Expressing Cardinality Quantifiers In Monadic Second-Order Logic Over Trees

Fundamenta Informaticae(2010)

引用 16|浏览19
暂无评分
摘要
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order.Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over finitely branching trees, which is notable for not all of these classes are analytic.Our approach is based on Shelah's composition method and uses basic results from descriptive set theory. The elimination result is constructive, yielding a decision procedure for the extended logic.
更多
查看译文
关键词
infinite trees,monadic second-order logic,cardinality quantifiers,Cantor topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要