Models of set theory with definable ordinals

DOI10.1007/s00153-004-0256-9zbMath1068.03032MaRDI QIDQ1777270

Ali Enayat

Publication date: 13 May 2005

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-004-0256-9

zbMATH Keywords

DO models; Paris models

Mathematics Subject Classification ID

03E35: Consistency and independence results

03C62: Models of arithmetic and set theory

Related Items

Pointwise definable models of set theory, Set theory with a proper class of indiscernibles, MINIMUM MODELS OF SECOND-ORDER SET THEORIES, Algebraicity and implicit definability in set theory, Model theory of the regularity and reflection schemes, Condensable models of set theory, CLASS FORCING, THE FORCING THEOREM AND BOOLEAN COMPLETIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can you take Solovay's inaccessible away?
• Set theory. An introduction to independence proofs
• Intermediate submodels and generic extensions in set theory
• Model theory
• A model of set-theory in which every set of reals is Lebesgue measurable
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Some applications of formalized consistency proofs
• On Certain Elementary Extensions of Models of Set Theory
• Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
• Forcing and Models of Arithmetic
• Large Models of Countable Height
• Axioms which imply GCH
• Counting models of set theory
• On the Leibniz–Mycielski axiom in set theory
• New set-theoretic axioms derived from a lean metamathematics
• Leibnizian models of set theory
• On the Lebesgue measurability and the axiom of determinateness
• The number of countable models
• Consistency results about ordinal definability
• Comparison of the axioms of local and universal choice