Incomparable $\omega_1$-like models of set theory
Gunter Fuchs, Victoria Gitman, Joel David Hamkins

TL;DR
This paper demonstrates that certain embedding theorems for countable models of set theory do not extend to uncountable $oldsymbol{ extomega_1}$-like models, revealing a rich diversity and incomparability among these models under specific hypotheses.
Contribution
It shows the failure of Hamkins embedding analogues for uncountable models, constructing many pairwise incomparable $oldsymbol{ extomega_1}$-like models with various embedding properties.
Findings
Existence of $2^{oldsymbol{ extomega_1}}$ many pairwise incomparable $oldsymbol{ extomega_1}$-like models of ZFC.
A transitive $oldsymbol{ extomega_1}$-like model of ZFC that does not embed into its constructible universe.
An $oldsymbol{ extomega_1}$-like model of PA with a hereditarily finite set structure not universal for such models.
Abstract
We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of -like models of set theory. Specifically, under the hypothesis and suitable consistency assumptions, we show that there is a family of many -like models of ZFC, all with the same ordinals, that are pairwise incomparable under embeddability; there can be a transitive -like model of ZFC that does not embed into its own constructible universe; and there can be an -like model of PA whose structure of hereditarily finite sets is not universal for the -like models of set theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Mathematical and Theoretical Analysis
