Skip to main content Accessibility help

Expressing cardinality quantifiers in monadic second-order logic over chains

  • Vince Bárány (a1), Łukasz Kaiser (a2) and Alexander Rabinovich (a3)


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.



Hide All
[1]Bárány, V., Kaiser, Ł., and Rabinovich, A., Expressing cardinality quantifiers in monadic second-order logic over trees, Fundamenta Informaticae, vol. 100 (2010).
[2]Baudisch, A., Seese, D., Tuschik, H.-P., and Weese, M., Decidability and generalized quantifiers, Akademie-Verlag, Berlin, 1980.
[3]Büchi, Julius R., Weak second-order arithmetic andfinite automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 6692.
[4]Büchi, Julius R., On decision method in restricted second order arithmetic, Proceedings of the international congress on logic, methodology and philosophy of science (Nagel, E., Suppes, P., and Tarski, A., editors), Studies in Logic and the Foundations of Mathematics, vol. 44, Elsevier, 1962, pp. 111.
[5]Büchi, Julius R. and Siefkes, Dirk, The monadic second order theory of all countable ordinals, Lecture Notes in Mathematics, vol. 328, Springer, 1973.
[6]Elgot, Calvin C., Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol. 98 (1961), pp. 2151.
[7]Gurevich, Yuri, Monadic theory of order and topology, I, Israel Journal of Mathematics, vol. 27 (1977), pp. 299319.
[8]Gurevich, Yuri, Modest theory of short chains I, this Journal, vol. 44 (1979), pp. 481490.
[9]Gurevich, Yuri, Monadic second-order theories, Model-theoretical logics (Barwise, Jon and Feferman, Solomon, editors), Springer, 1985, pp. 479506.
[10]Gurevich, Yuri, Magidor, Menachem, and Shelah, Saharon, The monadic theory of ω2, this Journal, vol. 48 (1983), pp. 387398.
[11]Gurevich, Yuri and Shelah, Saharon, Modest theory of short chains II, this Journal, vol. 44 (1979), pp. 491502.
[12]Kaufmann, Matt, The quantifier “there exists uncountably many” and some of its relatives, Model theoretic logics (Barwise, J. and Feferman, S., editors), Springer-Verlag, 1985, pp. 123176.
[13]Kuske, Dietrich and Lohrey, Markus, First-order and counting theories of omega-automatic structures, this Journal, vol. 73 (2008), pp. 129150.
[14]Mostowski, Andrzej, On a generalization of quantifiers, Fundamenta Mathematicae, vol. 44 (1957), pp. 1236.
[15]Niwiński, Damian, On the cardinality of sets of infinite trees recognizable by finite automata. Mathematical Foundations of Computer Science, MFCS'91, Proceedings, Lecture Notes in Computer Science, vol. 520, Springer, 1991, pp. 367376.
[16]Shelah, Saharon, The monadic theory of order, Annals of Mathematics, vol. 102 (1975), pp. 379419.
[17]Trakhtenbrot, Boris A., Finite automata and the logic of monadic predicates, Rossiĭskaya Akademiya Nauk. Doklady Akademii Nauk. SSSR, vol. 140 (1961), pp. 326329.
[18]Trakhtenbrot, Boris A., Finite automata and the logic of one-place predicates, Siberian Mathematical Journal, vol. 13 (1962), pp. 103131, in Russian.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed