Notes on monadic logic. Part B: Complexity of linear orders in ZFC
From MaRDI portal
Publication:912091
DOI10.1007/BF02764732zbMath0698.03034MaRDI QIDQ912091
Publication date: 1990
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items (2)
Trees, grids, and MSO decidability: from graphs to matroids ⋮ More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monadic logic and Löwenheim numbers
- The monadic theory and the next world
- Second-order quantifiers and the complexity of theories
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
- Notes on monadic logic. A: Monadic theory of the real line
- Proper forcing
- The monadic theory of order
- Monadic theory of order and topology, I
- A combinatorial principle and endomorphism rings. I: On \(p\)-groups
- More on monadic logic. Part D: A note on addition of theories
- Products of regular cardinals and cardinal invariants of products of Boolean algebras
- The monadic theory of ω2
- Interpreting second-order logic in the monadic theory of order
- On the strength of the interpretation method
- Monadic theory of order and topology in ZFC
- The decision problem for branching time logic
- Modest theory of short chains. II
This page was built for publication: Notes on monadic logic. Part B: Complexity of linear orders in ZFC