2000 character limit reached
Incomparable -like models of set theory
Published 5 Jan 2015 in math.LO | (1501.01022v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.