More on monadic logic. C: Monadically interpreting in stable unsuperstable T and the monadic theory of ^
[For Parts A and B see ibid. 63, No. 3, 335--352 (1988; Zbl 0664.03034) and ibid. 69, No. 1, 94--116 (1990; Zbl 0698.03034), respectively.] This paper contributes to the classification of pairs (\(\mathcal T,Q)\) where \(\mathcal T\) is a first order theory and \(Q\) is a quantifier. The main result concerns \(\mathcal T\) in a finite language which are stable but not superstable. For such \(\mathcal T\) ``one can, in monadic logic, interpret in it essentially trees \((^{\omega \geq}\lambda,<)\) with quantification \((Q^{pd}f)\) (on pressing down functions). Knowledge of earlier papers is required of the reader.
- Classification theory and the number of non-isomorphic models
- scientific article; zbMATH DE number 4006233 (Why is no real title available?)
- Interpreting second-order logic in the monadic theory of order
- Modest theory of short chains. II
- Monadic logic and Löwenheim numbers
- Monadic theory of order and topology in ZFC
- More on monadic logic. Part D: A note on addition of theories
- Notes on monadic logic. A: Monadic theory of the real line
- Notes on monadic logic. Part B: Complexity of linear orders in ZFC
- On the strength of the interpretation method
- Second-order quantifiers and the complexity of theories
- The decision problem for branching time logic
- The monadic theory and the next world
- The monadic theory of ω2
- The monadic theory of order
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
This page was built for publication: More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916645)
