Abstract
We deal with the monadic theory of linearly ordered sets and topological spaces, disprove two of Shelah’s conjectures and prove some more results. In particular, if the Continuum Hypothesis holds, then there exist monadic formulae expressing the predicates “X is countable” and “X is meager” in the real line and in Cantor’s Discontinuum.
Similar content being viewed by others
References
A. V. Arhangelski,On the cardinality of first countable compacta, Soviet Math. Doklady10 (1969), 951–955.
P. Erdös and R. Rado,A partition calculus in set theory, Bull. Amer. Math. Soc.62 (1956), 427–489.
A. Grzegorczyk,Undecidability of some topological theories, Fund. Math.38 (1951), 137–152.
Y. Gurevich, Monadic theory of order and topology, 1 (Abstract), J. Symbolic Logic, to appear.
Y. Gurevich,Monadic theory of order and topology, 2, in preparation.
Y. Gurevich and S. Shelah,Modest theory of short chains, II, in preparation.
Y. Gurevich and S. Shelah,Modesty, Notices Amer. Math. Soc.24 (1977), A-20.
T. J. Jech,Lectures in set theory, Springer Lecture Notes 217, 1971.
K. Kuratowski,Topology, Academic Press, New York, 1966.
D. A. Martin and R. M. Solovay,Internal Cohen extensions, Ann. Math. Logic2 (1970), 143–178.
M. O. Rabin,Decidability of second order theories and automata in infinite tress, Trans. Amer. Math. Soc.141 (1969), 1–35.
S. Shelah,The monadic theory of order, Ann. of Math.102 (1975), 379–419.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gurevich, Y. Monadic theory of order and topology, 1. Israel J. Math. 27, 299–319 (1977). https://doi.org/10.1007/BF02756489
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02756489