Expressing cardinality quantifiers in monadic second-order logic over chains

Vince Bárány*, Lukasz Kaiser, Alexander Rabinovich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We investigate the extension of monadic second-order logic of order with cardinality quantifiers "there exists uncountably many sets such that⋯" and "there exists continuum many sets such that⋯ ". We prove that over the class of countable linear orders the two quantifiers are equivalent and can be effectively and uniformly eliminated. Weaker or partial elimination results are obtained for certain wider classes of chains. In particular, we show that over the class of ordinals the uncountability quantifier can be effectively and uniformly eliminated. Our argument makes use of Shelah's composition method and Ramsey-like theorem for dense linear orders.

Original languageEnglish
Pages (from-to)603-619
Number of pages17
JournalJournal of Symbolic Logic
Volume76
Issue number2
DOIs
StatePublished - Jun 2011

Funding

FundersFunder number
Engineering and Physical Sciences Research CouncilEP/E010865/1

    Fingerprint

    Dive into the research topics of 'Expressing cardinality quantifiers in monadic second-order logic over chains'. Together they form a unique fingerprint.

    Cite this