EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE

DOI10.1142/S0219061313500062zbMath1326.03046arXiv1207.0963WikidataQ56813203 ScholiaQ56813203MaRDI QIDQ5401599

Joel David Hamkins

Publication date: 10 March 2014

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

Full work available at URL: https://arxiv.org/abs/1207.0963

zbMATH Keywords

embeddingsmodels of set theorycountable random \(\mathbb Q\)-graded digraphhypnagogic digraph

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Models of arithmetic and set theory (03C62)

Related Items (8)

THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES ⋮ Categoricity results for second-order ZF in dependent type theory ⋮ Incomparable ω₁‐like models of set theory ⋮ Indivisible sets and well‐founded orientations of the Rado graph ⋮ MINIMUM MODELS OF SECOND-ORDER SET THEORIES ⋮ Categoricity results and large model constructions for second-order ZF in dependent type theory ⋮ Rank-initial embeddings of non-standard models of set theory ⋮ INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY

Cites Work

• Generalizations of the Kunen inconsistency
• On interpretations of arithmetic and set theory
• Substandard models of finite set theory
• Elementary embeddings and infinitary combinatorics
• On the complexity of models of arithmetic
• Unnamed Item

This page was built for publication: EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE