On decidability properties of local sentences

DOI10.1016/j.tcs.2006.08.004zbMath1111.03010OpenAlexW2569306015MaRDI QIDQ860837

Olivier Finkel

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.004

zbMATH Keywords

decidability propertiesKurepa treeindependence result\(\omega _{2}\)-modellocal sentencesmodel of ordinal order type \(\alpha\)monadic theory of an ordinal

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (2)

Topological complexity of locally finite \(\omega\)-languages ⋮ Local sentences and Mahlo cardinals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monadic second order theory of all countable ordinals
• The monadic theory of order
• Reasoning about infinite computations
• Practical CTL* model checking: Should SPIN be extended?
• Closure properties of locally finite \(\omega\)-languages
• The monadic theory of ω₂
• Formal languages defined by the underlying structure of their words
• Stretchings
• Locally finite languages
• Introduction to set theory. The set theory of Georg Cantor and its axiomatization by Ernst Zermelo

This page was built for publication: On decidability properties of local sentences