The monadic theory of \((\omega{}_ 2,<)\) may be complicated (Q1190619)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The monadic theory of \((\omega{}_ 2,<)\) may be complicated |
scientific article; zbMATH DE number 55780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The monadic theory of \((\omega{}_ 2,<)\) may be complicated |
scientific article; zbMATH DE number 55780 |
Statements
The monadic theory of \((\omega{}_ 2,<)\) may be complicated (English)
0 references
26 September 1992
0 references
It would be an ill-posed problem to ask for a characterization of those sets \(B\subseteq\omega\) which are recursive is the monadic theory of \((\omega_ 2,\leq)\). In fact, a classical result of \textit{Y. Gurevich, M. Magidor} and \textit{S. Shelah} [J. Symb. Log. 48, 387-398 (1983; Zbl 0549.03010)] states that under the assumption of the existence of a weakly compact cardinal in the universe \(V\) of set theory, for every subset \(B\) of \(\omega\) there is a generic extension \(W\) of \(V\) in which \(B\) is recursive in the monadic theory of \((\omega_ 2,\leq)\). Of course \(W\) depends on \(B\). In the present paper the same conclusion is obtained without the assumption of the existence of large cardinals. More precisely, the following main theorem is proved. There is a set of sentences \(\{\theta_ n; n\in\omega\}\) in the monadic language of order such that: if \(V\) satisfies the GCH, then for each \(B\subseteq\omega\) there exists a forcing notion \(P\) which is \(\omega_ 1\)-closed, satisfies the \(\omega_ 3\)-chain condition, preserves cardinals, cofinalities and the GCH, \(| P|=\aleph_ 3\), such that \(P\) forces \(B=\{n; (\omega_ 2,\leq)\models\theta_ n\}\).
0 references
higher-order logic
0 references
monadic theory
0 references
generic extension
0 references
monadic language of order
0 references
GCH
0 references
forcing
0 references
0.77400213
0 references
0.71671903
0 references
0.69098896
0 references
0.6845014
0 references
0.68160415
0 references
0.6808422
0 references
0.6798035
0 references
0.67751485
0 references