2000 character limit reached
Condensable models of set theory
Published 9 Oct 2019 in math.LO | (1910.04029v4)
Abstract: We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary formulae in the well-founded part of M. We prove, assuming a modest set theoretic hypothesis, that there are condensable models M of ZFC such that every definable element of M is in the well-founded part of M. We also provide various characterizations of countable condensable models of ZF.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.