Models of set theory with definable ordinals

Abstract.A DO model (here also referred to a Paris model) is a model of set theory all of whose ordinals are first order definable in . 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 V=OD. Here we provide a comprehensive treatment of Paris models. Our results include the following:1. If T is a consistent completion of ZF+V≠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 κ there is a Paris model of ZF of cardinality κ which has a nontrivial automorphism.4. For a model ZF, is a prime model ⇒ is a Paris model and satisfies AC⇒ is a minimal model. Moreover, Neither implication reverses assuming Con(ZF).

[1]  H. Keisler Model theory for infinitary logic , 1971 .

[2]  Urlich Felgner,et al.  Comparison of the axioms of local and universal choice , 1971 .

[3]  Jan Mycielski,et al.  On the Lebesgue measurability and the axiom of determinateness , 1964 .

[4]  P. J. Cohen Set Theory and the Continuum Hypothesis , 1966 .

[5]  R. Solovay A model of set-theory in which every set of reals is Lebesgue measurable* , 1970 .

[6]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[7]  K. McAloon,et al.  Consistency results about ordinal definability , 1971 .

[8]  Jan Mycielski New Set-Theoretic Axioms Derived from a Lean Metamathematics , 1995, J. Symb. Log..

[9]  Stephen G. Simpson Forcing and models of arithmetic , 1974 .

[10]  Saharon Shelah,et al.  Can you take Solovay’s inaccessible away? , 1984 .

[11]  Serge Grigorieff Intermediate Submodels and Generic Extensions in Set Theory , 1975 .

[12]  Hao Wang,et al.  Some Applications of Formalized Consistency Proofs , 1955 .

[13]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[14]  Michael D. Morley The Number of Countable Models , 1970, J. Symb. Log..

[15]  Ali Enayat UNDEFINABLE CLASSES AND DEFINABLE ELEMENTS IN MODELS OF SET THEORY AND ARITHMETIC , 1988 .

[16]  Ali Enayat Leibnizian models of set theory , 2004, J. Symb. Log..

[17]  H. Friedman Large models of countable height , 1975 .

[18]  J. Mycielski Axioms which imply GCH , 2003 .

[19]  Ali Enayat On the Leibniz–Mycielski axiom in set theory , 2004 .

[20]  Ali Enayat On certain elementary extensions of models of set theory , 1984 .

[21]  A. Enayat Counting models of set theory , 2002 .