zbMATH — the first resource for mathematics

Models of set theory with definable ordinals. (English) Zbl 1068.03032
Summary: A DO model (here also referred to as a Paris model) is a model \(\mathfrak M\) of set theory all of whose ordinals are first-order definable in \(\mathfrak M\). Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension \(T\) of ZF has a DO model, and (2) for complete extensions \(T\), \(T\) has a unique DO model up to isomorphism iff \(T\) proves \(\mathbf V = \mathbf{OD}\). Here we provide a comprehensive treatment of Paris models. Our results include the following:
1. If \(T\) is a consistent completion of \(\text{ZF}+\mathbf V \not= \mathbf{OD}\), then \(T\) has continuum-many countable nonisomorphic Paris models.
2. Every countable model of ZFC has a Paris generic extension.
3. If there is an uncountable well-founded model of ZFC, then for every infinite cardinal \(\kappa\) there is a Paris model of ZF of cardinality \(\kappa\) which has a nontrivial automorphism.
4. For a model \(\mathfrak M \vDash \text{ZF}\), \(\mathfrak M\) is a prime model \(\Rightarrow \mathfrak M\) is a Paris model and satisfies \(\text{AC} \Rightarrow \mathfrak M\) is a minimal model. Moreover, neither implication reverses assuming Con(ZF).

03C62 Models of arithmetic and set theory
03E35 Consistency and independence results
Full Text: DOI
[1] Barwise, J.: Admissible Sets and Structures. Springer-Verlag, Berlin, 1975 · Zbl 0316.02047
[2] Chang, C.C., Keisler, H.J.: Model Theory. Elsevier North Holland, Amsterdam, 1973 · Zbl 0276.02032
[3] Cohen, P.: Set Theory and the Continuum Hypothesis. Benjamin, New York, 1966 · Zbl 0182.01301
[4] Cohen, P.: Automorphisms of set theory. In: Proceedings of the Tarski Symposium, (Proc. Sympos. Pure Math. Vol XXV, Univ. California, Berkeley, Calif. 1971), Amer. Math. Soc. Providence, RI, 1974, pp. 325-330
[5] Enayat, A.: On certain elementary extensions of models of set theory. Trans. Am. Math. Soc. 283, 705-715 (1984) · Zbl 0563.03033
[6] Enayat, A.: Undefinable classes and definable elements in models of set theory and arithmetic. Proc. Am. Math. Soc. 103, 1216-1220 (1988) · Zbl 0658.03022
[7] Enayat, A.: Counting models of set theory. Fund. Math. 174(1), 23-47 (2002) · Zbl 0998.03033
[8] Enayat, A.: On the Leibniz-Mycielski axiom in set theory. Fund. Math. 181, 215-231 (2004) · Zbl 1051.03041
[9] Enayat, A.: Leibnizian Models of Set Theory. J. Sym. Logic 69, 775-789 (2004) · Zbl 1070.03023
[10] Felgner, U.: Comparisons of the axioms of local and universal choice. Fund. Math. 71, 43-62 (1971) · Zbl 0255.02065
[11] Friedman, H.: Large models of countable height. Tran. Am. Math. Soc. 201, 227-239 (1975) · Zbl 0296.02036
[12] Grigorieff, S.: Intermediate submodels and generic extensions in set theory. Ann. Math. 101, 447-490 (1975) · Zbl 0308.02060
[13] Halpern, J.D.: Lévy, A.: The Boolean prime ideal theorem does not imply the axiom of choice. In: Axiomatic Set Theory, D. Scott (ed.), Part I, Proc. Symp. Pure Math. 13, vol. I, American Mathematical Society. Providence, RI, 1971, pp. 83-134
[14] Jech, T.: Set Theory. Academic Press, New York, 1978 · Zbl 0419.03028
[15] Jensen, R., Solovay, R.: Applications of almost disjoint forcing. In: Mathematical Logic and Foundations of Set Theory, Y. Bar-Hillel (ed.), North-Holland, Amsterdam, 1970, pp. 84-104 · Zbl 0222.02077
[16] Keisler, H.J.: Model Theory for Infinitary Logic. North-Holland, Amsterdam, 1971 · Zbl 0222.02064
[17] Kreisel, G., Wang, H.: Some applications of formal consistency proofs. Fund. Math. 42, 101-110 (1955) · Zbl 0067.25201
[18] Kunen, K.: Set Theory. North Holland, Amsterdam, 1980 · Zbl 0443.03021
[19] McAloon, K.: Consistency results about ordinal definability. Annals Math. Logic, 2, 449-467 (1971) · Zbl 0225.02044
[20] Morley, M.: The number of countable models. J. Sym. Logic, 35, 14-18 (1970) · Zbl 0196.01002
[21] Mycielski, J.: New set-theoretic axioms derived from a lean metamathematics. J. Sym. Logic, 60, 191-198 (1995) · Zbl 0834.03017
[22] Mycielski, J.: Axioms which imply GCH. Fund. Math. 176, 193-207 (2003) · Zbl 1020.03046
[23] Mycielski, J., Swierczkowski, S.: On the Lebesgue measurability and the axiom of determinateness. Fund. Math. 54, 67-71 (1964) · Zbl 0147.19503
[24] Myhill, J., Scott, D.: Ordinal definability. In: Axiomatic Set Theory, D. Scott (ed.), Part I, Proc. Symp. Pure Math. 13, vol. I, American Mathematical. Society, Providence, RI, 1970, pp. 271-278 · Zbl 0226.02048
[25] Paris, J.: Minimal models of ZF. Proceedings of the Bertrand Russell Memorial Conference, Leeds Univ. Press, 1973, pp. 327-331
[26] Shelah, S.: Can you take Solovay?s inaccessible away? Israel J. Math. 48, 1-47 (1984) · Zbl 0596.03055
[27] Simpson, S.: Forcing and models of arithmetic. Proc. Am. Math. Soc. 43, 93-194 (1974) · Zbl 0291.02037
[28] Solovay, R.: A model of set theory in which every set of reals is Lebesgue measurable. Ann. Math. 92, 1-56 (1970) · Zbl 0207.00905
[29] Suzuki, Y., Wilmers, G.: Non-standard models for set theory. Proceedings of the Bertrand Russell Memorial Conference, Leeds Univ. Press, 1973, pp. 278-314
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.