Abstract
A model \({\mathcal {M}}\) of ZF is said to be condensable if \( {\mathcal {M}}\cong {\mathcal {M}}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\) for some “ordinal” \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\), where \(\mathcal {M}(\alpha ):=(\mathrm {V}(\alpha ),\in )^{{\mathcal {M}}}\) and \(\mathbb {L}_{{\mathcal {M}}}\) is the set of formulae of the infinitary logic \(\mathbb {L}_{\infty ,\omega }\) that appear in the wellfounded part of \({\mathcal {M}}\). The work of Barwise and Schlipf in the 1970s revealed the fact that every countable recursively saturated model of ZF is cofinally condensable (i.e., \({\mathcal {M}}\cong {\mathcal {M}}(\alpha ) \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\)). Moreover, it can be readily shown that any \(\omega \)nonstandard condensable model of \(\mathrm {ZF}\) is recursively saturated. These considerations provide the context for the following result that answers a question posed to the author by Paul Kindvall Gorbow.
Theorem A. Assuming a modest settheoretic hypothesis, there is a countable model \({\mathcal {M}}\) of ZFC that is both definably wellfounded (i.e., every first order definable element of \({\mathcal {M}}\) is in the wellfounded part of \(\mathcal {M)}\) and cofinally condensable. We also provide various equivalents of the notion of condensability, including the result below.
Theorem B. The following are equivalent for a countable model \({\mathcal {M}}\) of \(\mathrm {ZF}\): (a) \({\mathcal {M}}\) is condensable. (b) \({\mathcal {M}}\) is cofinally condensable. (c) \({\mathcal {M}}\) is nonstandard and \(\mathcal {M}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \( \alpha \in \mathrm {Ord}^{{\mathcal {M}}}\).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
By a classical theorem of Harvey Friedman [8], every countable nonstandard model \({\mathcal {M}}\) of \(\mathrm {ZF}\) can be “shrunk” in the sense that \({\mathcal {M}}\) is isomorphic to a proper rankinitial segment of itself. Friedman’s theorem was refined by JeanPierre Ressayre [15], who constructed proper rankinitial selfembeddings of models of set theory that pointwise fix any prescribed rankinitial segment \(\mathcal {M}(\alpha ):=(\mathrm {V} (\alpha ),\in )^{{\mathcal {M}}}\) of a model \({\mathcal {M}}\) of set theory determined by an “ordinal” \(\alpha \in \) \( \mathrm {Ord}^{{\mathcal {M}}}\). More recently, Paul Kindvall Gorbow [9] extended Ressayre’s work by carrying out a systematic study of the structure of fixed point sets of rank initial selfembeddings of models of set theory; and Zachiri McKenzie and the author [7], studied selfembeddings whose images are only required to be \(\in \)initial segments of the ambient models.
By a general result of Gorbow [10, Theorem 7.2] if \({\mathcal {M}}\) is a countable nonstandard model of the fragment \(\mathrm {KP}^{\mathcal {P} }+\Sigma _{1}^{\mathcal {P}}\)\(\mathrm {Separation}\) of \(\mathrm {ZF}\), then there are continuummany proper rankinitial segments \(\mathcal {N}\) of \( {\mathcal {M}}\) that are isomorphic to \({\mathcal {M}}\), which makes it clear that there are continuum many such rankinitial segments \(\mathcal {N}\) that are not of the form \(\mathcal {M}(\alpha )\) for any “ordinal” \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\) (equivalently: \(\mathrm {Ord}^{{\mathcal {M}}}\backslash \mathrm {Ord}^{\mathcal {N }}\) has no least element). It is also known that every consistent extension of ZF has a countable model \({\mathcal {M}}\) that is not isomorphic to any initial segment of itself that is of the form \(\mathcal {M}(\alpha )\) for any \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\).^{Footnote 1} On the other hand, the pioneering work of Barwise and Schlipf on recursively saturated models in the 1970s revealed a wealth of countable models \({\mathcal {M}}\) of set theory such that \(\mathcal {M}\cong M(\alpha )\prec {\mathcal {M}}\) for many \(\alpha \in \mathrm {Ord}^{{\mathcal {M}} },\) as indicated by the following theorem.
Theorem 1.1
(Barwise and Schlipf) Let \({\mathcal {M}}\)be a countable recursively saturated model of \( \mathrm {ZF.} \) Then there is some \(\alpha \in \mathrm {Ord}^{ {\mathcal {M}}}\) such that \({\mathcal {M}}\cong {\mathcal {M}}(\alpha )\prec {\mathcal {M}}\). Moreover, the collection of such \(\alpha \)s is unbounded in \(\mathrm {Ord}^{{\mathcal {M}}}.\)^{Footnote 2}
Motivated by the above theorem, we say that a model \({\mathcal {M}}\) of ZF is condensable if there is some \(\alpha \in \mathrm {Ord}^{ {\mathcal {M}}}\) such that \({\mathcal {M}}\cong \mathcal {M}(\alpha )\prec _{ \mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}},\) where \(\mathcal {M}(\alpha ):=(\mathrm { V}(\alpha ),\in )^{{\mathcal {M}}}\) and \(\mathbb {L}_{{\mathcal {M}}}\) consists of formulae of the infinitary logic \(\mathbb {L}_{\infty ,\omega }\) that appear in the wellfounded part of \({\mathcal {M}}\). Note that for an \(\omega \) nonstandard model \({\mathcal {M}}\) of ZF, \(\mathbb {L}_{{\mathcal {M}}}\) is just the collection of (finitary) first order formulae, so the condition \( {\mathcal {M}}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) is equivalent to \(\mathcal {M}(\alpha )\prec {\mathcal {M}}\) for \(\omega \) nonstandard models \({\mathcal {M}}\) (and in particular for recursively saturated models \({\mathcal {M}}\)). Theorem 1.1 provides the background for a question posed in an email to the author (June 14, 2019).
Question 1.2
(Gorbow) Is there an \(\omega \) standard model \({\mathcal {M}}\) of \(\mathrm {ZF}\) such that the collection of \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\) satisfying \({\mathcal {M}}\cong {\mathcal {M}}(\alpha )\prec {\mathcal {M}}\) is unbounded in \(\mathrm {Ord}^{{\mathcal {M}}}\)?
In this article we establish Theorem A of the abstract (in Sect. 2) and a strengthening of Theorem B of the abstract (in Sect. 3). Theorem A yields a (strong) positive answer to Gorbow’s question. Theorem B, on the other hand, provides various characterizations of condensability over the family of countable models of ZF.
2 Preliminaries
In this section we collect the basic definitions, notations, conventions, and results that will be used in the statements and proofs of our main results in Sects. 2 and 3.
Definition 2.1
(Models, languages, and theories) Models will be represented by calligraphic fonts (\({\mathcal {M}}\), \(\mathcal {N}\), etc.) and their universes will be represented by the corresponding roman fonts (M, N, etc.). In the definitions below, \({\mathcal {M}}\) is a model of ZF and \(\in ^{{\mathcal {M}}}\) is the membership relation of \({\mathcal {M}}\).
(a) \(\mathrm {Ord}^{{\mathcal {M}}}\) is the class of “ordinals” of \({\mathcal {M}}\), i.e., \( \mathrm {Ord}^{{\mathcal {M}}}:=\left\{ m\in M:{\mathcal {M}}\models \mathrm {Ord} (m)\right\} ,\) where \(\mathrm {Ord}(x)\) expresses “x is transitive and is wellordered by \(\in \)” . More generally, given a class \(\mathrm {D}\) whose defining formula is \(\delta (x)\), \(\mathrm {D }^{{\mathcal {M}}}:=\left\{ m\in M:{\mathcal {M}}\models \delta (m)\right\} .\)
(b) \({\mathcal {M}}\) is nonstandard if \(\in ^{ {\mathcal {M}}}\) is illfounded (equivalently: if \((\mathrm {Ord},\in )^{ {\mathcal {M}}}\) is illfounded). \({\mathcal {M}}\) is \(\omega \)nonstandard if (\(\omega ,\in )^{{\mathcal {M}}}\) is illfounded.
(c) For \(c\in M\), \(\mathrm {Ext}_{{\mathcal {M}}}(c)\) is the \( {\mathcal {M}}\)extension of c, i.e., \(\mathrm {Ext}_{{\mathcal {M}}}(c):=\{m\in M:m\in ^{{\mathcal {M}}}c\}.\) We say that a subset X of M is coded in \({\mathcal {M}}\) if there is some \(c\in M\) such that \(\mathrm {Ext}_{ {\mathcal {M}}}(c)=X.\) For \(A\subseteq M\), \(\mathrm {Cod}_{A}\mathrm {(}\mathcal { M)}\) will denote the collection of sets of the form \(A\cap \mathrm {Ext}_{ {\mathcal {M}}}(c)\), where \(c\in M\).
(d) Given a model \(\mathcal {N}\) of ZF, we write \(\mathcal { M}\subseteq _{\mathrm {rank}}\mathcal {N}\) (read as: \({\mathcal {M}}\) is rankextended by \({\mathcal {M}}\), or \({\mathcal {M}}\) is a rankinitial segment of \(\mathcal {N}\)), to indicate that \({\mathcal {M}}\) is a submodel of \( \mathcal {N}\) such that \(\rho ^{{\mathcal {M}}}(x)>\) \(\rho ^{{\mathcal {M}}}(m)\) whenever \(x\in N\backslash M\) and \(m\in M,\) where \(\rho (x)\) is the usual ordinalvalued rank function of set theory.
(e) The wellfounded part of \({\mathcal {M}}\), denoted \(\mathrm {WF}({\mathcal {M}})\), consists of all elements m of \( {\mathcal {M}}\) such that there is no infinite sequence \(\left\langle a_{n}:n<\omega \right\rangle \) with \(m=a_{0}\) and \(a_{n+1}\in ^{{\mathcal {M}} }a_{n}\) for all \(n\in \omega .\) Given \(m\in M,\) we say that m is a nonstandard element of \({\mathcal {M}}\) if \(m\notin \mathrm {WF}(\mathrm {M}).\) We denote the submodel of \({\mathcal {M}}\) whose universe is \(\mathrm {WF}( {\mathcal {M}})\) by \(\mathcal {WF}({\mathcal {M}}).\) It is wellknown that if \( {\mathcal {M}}\) is a model of \(\mathrm {ZF}\), then \(\mathcal {WF}({\mathcal {M}} )\subseteq _{\mathrm {rank}}{\mathcal {M}}\), and \(\mathcal {WF}({\mathcal {M}})\) satisfies KP (KripkePlatek set theory) [1][Chapter II, Theorem 8.4]. Also note that if \({\mathcal {M}}\subseteq _{\mathrm {rank}} \mathcal {N}\), where \({\mathcal {M}}\) is nonstandard, then \({\mathcal {M}}\) and \(\mathcal {N}\) share the same wellfounded part.

It is important to bear in mind that we will identify \( \mathcal {WF}({\mathcal {M}})\) with its transitive collapse.
(f) \(\mathrm {o}({\mathcal {M}})\) (read as: the ordinal of \({\mathcal {M}}\)) is the supremum of all ordinals that appear in the wellfounded part of \({\mathcal {M}}\).
(g) Let \(\mathcal {L}_{\mathrm {set}}\) be the usual vocabulary \(\{=,\in \}\) of set theory. In this paper we use \(\mathbb {L} _{\infty ,\omega }\) to denote the language using the vocabulary \(\mathcal {L} _{\mathrm {set}}\) that allows conjunctions and disjunctions of sets (but not proper classes) of formulae, subject to the restriction that such infinitary formulae have at most finitely many free variables. Given a set \( \Psi \) of formulae, we denote such conjunctions and disjunctions respectively as \(\bigwedge \Psi \) and \(\bigvee \Psi \).

In the interest of efficiency, we will treat disjunctions and universal quantification as defined notions.
(h) \(\mathbb {L}_{\delta ,\omega }\) is the sublanguage of \( \mathbb {L}_{\infty ,\omega }\) that allows conjunctions and disjunctions of sets of formulae of cardinality less than \(\delta .\) Note that \( \mathbb {L}_{\omega ,\omega }\) is none other than the usual first order language of set theory, and that in general the language \(\mathbb {L}_{\delta ,\omega }\) only uses finite strings of quantifiers (as indicated by the \( \omega \) in the subscript). A full treatment can be found in [1, Chapter III].
(i) Given \(\mathbb {L}\subseteq \mathbb {L}_{\infty ,\omega }\), and \(\mathcal {L}_{\mathrm {set}}\)structures \(\mathcal {N}_{1}\) and \( \mathcal {N}_{2}\), we write \(\mathcal {N}_{1}\prec _{\mathbb {L}}\mathcal {N} _{2} \) to indicate that \(\mathcal {N}_{1}\) is a submodel of \(\mathcal {N}_{2}\) and for every \(\varphi (x_{1},\ldots ,x_{n})\in \mathbb {L}\), and any ntuple \((a_{1},\ldots ,a_{n})\) from \(N_{1}\), we have:
(j) \(\mathbb {L}_{{\mathcal {M}}}=\mathbb {L}_{\infty ,\omega }\cap \mathrm {WF}(\mathcal {M)}\). Note that if M is countable, \( \mathbb {L}_{{\mathcal {M}}}=\mathbb {L}_{\omega _{1},\omega }\cap \mathrm {WF}( \mathcal {M)}\).
(k) Given \(\mathbb {L}\subseteq \mathbb {L}_{\infty ,\omega }\), \(\mathrm {Th}_{\mathbb {L}}(\mathcal {M)}\) is the set of sentences (closed formulae) of \(\mathbb {L}\) that hold in \({\mathcal {M}}\), and \(\mathrm {ZF}( \mathbb {L})\) is the natural extension of ZF in which the scheme \(\mathrm {Sep} \) of separation and \(\mathrm {Coll}\) of collection are extended to the schemes \(\mathrm {Sep}(\mathbb {L})\) and \(\mathrm {Coll}(\mathbb {L})\) to allow formulae in \(\mathbb {L}\) to be used for “ separating” and “ collecting” (respectively).
(l) For \(\varphi \in \mathbb {L}_{\infty ,\omega }\), the depth of \(\varphi ,\) denoted \(\mathrm {Depth}(\varphi )\), is the ordinal defined recursively by the following clauses:

(1)
\(\mathrm {Depth}(\varphi )=0\), if \(\varphi \) is an atomic formula.

(2)
\(\mathrm {Depth}(\varphi )=\mathrm {Depth}(\psi )+1,\) if \( \varphi =\lnot \psi .\)

(3)
\(\mathrm {Depth}(\varphi )=\mathrm {Depth}(\psi )+1,\) if \( \varphi =\exists x\ \psi .\)

(4)
\(\mathrm {Depth}(\varphi )=\sup \{\mathrm {Depth}(\psi )+1:\psi \in \Psi \}\), if \(\varphi =\bigwedge \Psi .\)

Within KP, one can code each formula \(\varphi \in \mathbb {L}_{\infty ,\omega }\) with a set \(\ulcorner \varphi \urcorner \) as in Chapter 3 of [1], but in the interest of better readability we will often identify a formula with its code. This coding allows us to construe statements such as \(\varphi \in \mathbb {L}_{\infty ,\omega }\) and \(\mathrm { Depth}(\varphi )=\alpha \) as statements in the first order language of set theory. It is easy to see that the collection \(\mathrm {D(}\alpha )\) of (codes of) \(\mathbb {L}_{\infty ,\omega }\)formulae whose depth is less than \( \alpha \) forms a set in ZF for all ordinals \(\alpha \) since a simple induction shows that for a sufficiently large \(k\in \omega \), \(\mathrm {D(} \alpha )\subseteq \mathrm {V(}\omega +k\alpha )\) for each ordinal \(\alpha \). This makes it clear that \(\mathbb {L}_{{\mathcal {M}}}=\bigcup \nolimits _{\alpha \in \mathrm {o}({\mathcal {M}})}\mathrm {D}^{{\mathcal {M}}}\mathrm {(}\alpha ).\)
Definition 2.2
Suppose \({\mathcal {M}}\) is a model of \( \mathrm {ZF}\), and \(S\subseteq M\).

(a)
S is separative (over \({\mathcal {M}}\)) if \(( {\mathcal {M}},S)\) satisfies the separation scheme \(\mathrm {Sep(S)}\) in the extended language that includes a fresh predicate S (interpreted by S).

(b)
S is collective (over \({\mathcal {M}}\)) if \(( {\mathcal {M}},S)\) satisfies the collection scheme \(\mathrm {Coll(S)}\) in the extended language that includes a fresh predicate S (interpreted by S).

(c)
S is amenable (over \({\mathcal {M}}\)) if S is both separative and collective. In other words, S is amenable if \( \left( {\mathcal {M}},S\right) \) satisfies the replacement scheme \(\mathrm {Repl} (S)\) in the extended language that includes a fresh predicate S (interpreted by S).

(d)
For \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\), S is an \(\alpha \)satisfaction class (over \({\mathcal {M}}\)) if S correctly decides the truth of atomic sentences, and S satisfies Tarski’s compositional clauses of a truth predicate for D\(^{{\mathcal {M}}}\) (\(\alpha )\)sentences (see below for the precise definition). S is an \(\infty \)satisfaction class over \({\mathcal {M}}\), if S is an \(\alpha \) satisfaction class over \({\mathcal {M}}\) for every \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\).
We elaborate the meaning of (d) above. Reasoning within KP , for each object a in the universe of sets, let \(c_{a\text { }}\) be a constant symbol denoting a (where the map \(a\mapsto c_{a}\) is \(\Delta _{1}),\) and let \(\mathrm {Sent}^{+}(\alpha ,x)\) be the settheoretic formula (with an ordinal parameter \(\alpha \) and the free variable x) that defines the proper class of sentences of the form \(\varphi \left( c_{a_{1}},\ldots ,c_{a_{n}}\right) \), where \(\varphi (x_{1},\ldots ,x_{n})\in \mathrm {D}\)(\(\alpha )\) (the superscript \(+\) on \(\mathrm { Sent}^{+}(\alpha ,x)\) indicates that x is a sentence in the language augmented with the indicated proper class of constant symbols). Then S is an \(\alpha \)satisfaction class over \({\mathcal {M}}\) if \(\left( {\mathcal {M}} ,S\right) \models \mathrm {Sat}(\alpha ,\mathrm {S})\), where \(\mathrm {Sat} (\alpha ,\mathrm {S})\) is the (universal generalization of) the conjunction of the axioms (I) through (IV) below.
\((I)\ \ \left( \left( \mathrm {S}\left( \ulcorner c_{a}=c_{b}\urcorner \right) \leftrightarrow a=b\right) \wedge \left( \mathrm {S}\left( \ulcorner c_{a}\in c_{b}\urcorner \right) \leftrightarrow a\in b\right) \right) .\)
\((II)\ \ \left( \mathrm {Sent}^{+}(\alpha ,\varphi )\wedge \left( \varphi =\lnot \psi \right) \right) \rightarrow \left( \mathrm {S}(\varphi )\leftrightarrow \lnot \mathrm {S}\mathsf {(}\psi \mathsf {)}\right) \mathsf {.}\)
(III) \(\ \left( \mathrm {Sent}^{+}(\alpha ,\varphi )\wedge \left( \varphi =\bigwedge \Psi \right) \right) \rightarrow \left( \mathrm {S} (\varphi )\leftrightarrow \forall \psi \in \Psi \ \mathrm {S}\mathsf {(}\psi \mathsf {)}\right) \mathsf {.}\)
(IV) \(\ \left( \mathrm {Sent}^{+}(\alpha ,\varphi )\wedge \left( \varphi =\exists x\ \psi (x)\right) \right) \rightarrow \left( \mathrm {S} (\varphi )\leftrightarrow \exists x\ \mathrm {S}{(\psi }(c_{x}))\right) .\)
(e) For \(\alpha <\mathrm {o}({\mathcal {M}})\), S is the \(\alpha \)satisfaction class over \({\mathcal {M}},\) if S is the usual Tarskian satisfaction class for formulae in \(\mathbb {L}_{{\mathcal {M}}}\) of depth less than \(\alpha ,\) i.e., the unique \(\alpha \)satisfaction class S over \({\mathcal {M}}\) such that S satisfies:
(V) \(\ \forall x\left( \mathrm {S}(x)\rightarrow \mathrm {Sent} ^{+}(\alpha ,x)\right) .\)

In the interest of a lighter notation we will often confuse constant symbols in formulae with their denotations, e.g., we will write \(\varphi (a)\) instead of \(\varphi (c_{a}).\)
The following proposition is immediately derivable from the definitions involved.
Proposition 2.3
If S is an \(\alpha \)satisfaction class over \({\mathcal {M}}\models \mathrm {KP}\) for some nonstandard ordinal \(\alpha \) of \({\mathcal {M}}\), then for all nary formula \(\varphi (x_{1},\ldots ,x_{n}) \) of \(\mathbb {L}_{{\mathcal {M}}}\) and all ntuples \((a_{1},\ldots ,a_{n})\) from M, we have:
In particular, for all sentences \(\varphi \) of \( \mathbb {L}_{{\mathcal {M}}},\) \(\varphi \in S\) iff \(\varphi \in \mathrm { Th}_{\mathbb {L}_{{\mathcal {M}}}}(\mathcal {M)}.\)
Remark 2.4
Reasoning within ZF, given any limit ordinal \(\gamma ,\) \(\left( \mathrm {V}(\gamma ),\in \right) \) carries a separative \( \gamma \)satisfaction class S since we can take S to be the Tarskian satisfaction class on \(\left( \mathrm {V}(\gamma ),\in \right) \) for formulae of depth less than \(\gamma \). More specifically, the Tarski recursive construction/definition of truth works equally well in this more general context of infinitary languages since \(\left( \mathrm {V}(\gamma ),\in \right) \) forms a set. Observe that \(\left( \mathrm {V}(\gamma ),\in ,S\right) \models \mathrm {Sep(S)}\) comes “for free” since for any \(X\subseteq \mathrm {V}(\gamma )\) the expansion \(\left( \mathrm {V}(\gamma ),\in ,X\right) \) satisfies the scheme of separation in the extended language. However, S need not be collective, for example if the collection of first order definable elements of \(\left( \mathrm {V}(\gamma ),\in \right) \) is cofinal in \(\gamma \).
Proposition 2.5
If\({\mathcal {M}}\models \mathrm { KP}\), then for each \(\alpha \in \mathrm {o}({\mathcal {M}})\) there is a formula \(\mathrm {Sat}_{\alpha }(x)\in \mathbb {L}_{{\mathcal {M}}}\) such that \(\mathrm {Sat}_{\alpha }^{{\mathcal {M}}}(x)\) is the \(\alpha \)satisfaction class over \({\mathcal {M}}.\)
Proof
The desired formula \(\mathrm {Sat}_{\alpha }(x)\) is defined by the following recursion. A routine induction on \(\alpha \) shows that \(\mathrm {Sat}_{\alpha }(x)\) has the desired properties. One can also verify that \(\mathrm {Sat}_{\alpha }(x)\in \mathrm {WF}({\mathcal {M}})\) for \( \alpha \in \mathrm {o}({\mathcal {M}})\) by observing that the recursion defining \(\mathrm {Sat}_{\alpha }(x)\) is a socalled \(\Sigma _{1}\)recursion (recall that \(\mathcal {WF}({\mathcal {M}})\) satisfies \(\mathrm {KP}\), and \(\mathrm {KP}\) can handle constructions by \(\Sigma _{1}\)recursion). \(\square \)

\(\mathrm {Sat}_{1}(x):=\exists y\exists z\left[ \left( \left( x=\ulcorner c_{y}=c_{z}\urcorner \right) \wedge (y=z)\right) \vee \left( \left( x=\ulcorner c_{y}\in c_{z}\urcorner \right) \wedge (y\in z)\right) \right] .\)

For \(\alpha >1,\) \(\mathrm {Sat}_{\alpha }(x):=\left[ \left( \mathrm { Depth}(x)=0\right) \wedge \mathrm {Sat}_{1}(x)\right] \vee \)
$$\begin{aligned} \bigvee \limits _{0<\beta <\alpha }\left( \mathrm {Depth}(x)=\beta \wedge [\mathrm {Neg}_{\beta }(x)\vee \mathrm {Exist}_{\beta }(x)\vee \mathrm { Conj}_{\beta }(x)]\right) , \end{aligned}$$
where:
\(\square \)
The following proposition will be called upon in the proofs of Theorems A and B.
Proposition 2.6
(Overspill) Suppose \( {\mathcal {M}}\) is a nonstandard model of \(\mathrm {ZF}\), and \( S\subseteq M\) such that S is separative over \({\mathcal {M}} \). Assume furthermore that there is a first order formula \(\theta (x,\overline{y})\) in the language \(\left\{ \in ,\mathrm {S}\right\} \) and some sequence of parameters \(\overline{m}\in M\) such that \(({\mathcal {M}},S)\models \theta (\alpha ,\overline{m})\) for every \(\alpha \in \mathrm {o}({\mathcal {M}}).\) Then there is a nonstandard \(\gamma \in \mathrm {Ord}^{{\mathcal {M}}}\) such that \(( {\mathcal {M}},S)\models \theta (\gamma ,\overline{m}). \)
Proof
Suppose not, and let \(A:=\mathrm {WF}({\mathcal {M}} )\cap \mathrm {Ord}^{{\mathcal {M}}}.\) Then \(A=\left\{ x\in M:\left( {\mathcal {M}} ,S\right) \models \theta (x,\overline{m})\wedge \mathrm {Ord}(x)\right\} \). Since A is a bounded subset of \(\mathrm {Ord}^{{\mathcal {M}}}\), A is coded in \({\mathcal {M}}\) by \(\mathrm {Sep(S)}\), and therefore has a supremum \(\beta \) in \({\mathcal {M}}\). This is a contradiction since \(\left( \beta ,\in \right) ^{ {\mathcal {M}}}\) is wellfounded, and yet \(\beta \notin A\) since A has no last element. \(\square \)
The following general versions of the elementary chains theorem of model theory, and of the reflection theorem of set theory will be called upon in the proof of Theorem B. The proofs of Proposition 2.7 is obtained by a routine adaptations of the usual proofs of the \(\mathbb {L}_{\omega ,\omega }\) version of the elementary chain theorem (e.g., as in [3][Theorem 3.1.9]).
Proposition 2.7
(Elementary Chains) Suppose \( \mathbb {L}\subseteq \mathbb {L}_{\infty ,\omega }\) where \(\mathbb {L}\) is closed under subformulae; \((I,\vartriangleleft )\) is a linear order; \(\left\langle {\mathcal {M}}_{i}:i\in I\right\rangle \) is an \(\mathbb {L}\)elementary chain of structures (i.e. , \({\mathcal {M}}_{i}\prec _{\mathbb {L}}{\mathcal {M}}_{j}\) whenever \( i\vartriangleleft j\)); and \({\mathcal {M}}=\bigcup \limits _{i\in I} {\mathcal {M}}_{i}.\)Then \({\mathcal {M}}_{i}\prec _{\mathbb {L}}\mathcal { M}\) for each \(i\in I.\)
Proposition 2.8
(Reflection) Suppose \({\mathcal {M}}\models \mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}}),\) and for each \(\varphi \in \mathbb {L}_{{\mathcal {M}}}\) where \(\varphi \) is nary, let \(\mathrm {Ref}_{\varphi }(\gamma )\) be the \(\mathbb {L}_{{\mathcal {M}}}\)formula:
Then for any \(\alpha \in \mathrm {o}({\mathcal {M}})\) there are arbitrarily large \(\gamma \in \mathrm {Ord}^{{\mathcal {M}}}\) such that \({\mathcal {M}}(\gamma )\) reflects all formulae in D \(^{{\mathcal {M}}}\)(\(\alpha ),\) i.e., \({\mathcal {M}}\models \mathrm {Ref} _{\varphi }(\gamma )\) for all \(\mathbb {L}_{{\mathcal {M}}}\) formulae \(\varphi \) of depth less than \(\alpha . \)
Proof
We will take advantage of Proposition 2.5 to derive Proposition 2.8 from the usual finitary formulation of Reflection Theorem^{Footnote 3}. Given \(\alpha \in \mathrm {o}({\mathcal {M}}),\) by Proposition 2.5, there is a formula \(\mathrm {Sat}_{\alpha }(x)\in \mathbb {L} _{{\mathcal {M}}}\) such that \(\mathrm {Sat}_{\alpha }^{{\mathcal {M}}}(x)\) is an \(\alpha \)satisfaction class over \({\mathcal {M}}\). Let \(S:=\mathrm {Sat} _{\alpha }^{{\mathcal {M}}}(x)\); note that since \({\mathcal {M}}\) is assumed to satisfy \(\mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}})\), S is amenable over \( {\mathcal {M}}\). Let \(\mathrm {Sat}(\alpha ,\mathrm {S})\) be the finitary formula that express “S is an \(\alpha \)satisfaction class” (as in part (d) of Definition 2.2). By the amenability of S over \({\mathcal {M}}\), we may invoke the usual finitary Reflection Theorem to obtain arbitrarily large \(\gamma \in \mathrm {Ord}^{M}\) such that \(\left( {\mathcal {M}}(\gamma ),S\cap M(\gamma )\right) \) reflects the formula \(\psi (x,\mathrm {S}):=\mathrm {Sat}(\alpha ,\mathrm {S})\wedge \mathrm {S}(x),\) i.e.,
It is now easy to verify, using Proposition 2.3, that this choice of \(\gamma \) satisfies the conclusion of Proposition 2.8. \(\square \)
3 Proof of Theorem A
The proof of Theorem A is based on some preliminary results. The reader may wish to skip the proofs of these results in the first reading to be able to better see the overall structure of the proof of Theorem A.
Lemma 3.1
Suppose \({\mathcal {M}}\) and \( \mathcal {N}\) are countable nonstandard models of \(\mathrm {ZF}\) with the same wellfounded part W, and let \(\mathbb {L}:= \mathbb {L}_{{\mathcal {M}}}=\mathbb {L}_{\mathcal {N}}.\) Then \(\mathcal {M }\)and \(\mathcal {N}\) are isomorphic if the following three conditions are satisfied:
(I) \(\mathrm {Cod}_{W}({\mathcal {M}})=\mathrm {Cod}_{W}(\mathcal {N})\).
(II) \(\mathrm {Th}_{\mathbb {L}}(\mathcal {M)}=\mathrm {Th}_{\mathbb { L}}\mathrm {(}\mathcal {N)}\)
(III) For some nonstandard ordinals \(\tau _{M}\) of \({\mathcal {M}}\) and \(\tau _{N}\) of \(\mathcal {N}\) there are \(S_{M}\subseteq M\) and \(S_{N}\subseteq N\) such that \(S_{M}\) is a separative \(\tau _{M}\) satisfaction class over \({\mathcal {M}}\), and \(S_{N}\) is a separative \(\tau _{N}\)satisfaction class over \(\mathcal {N}\).
Proof
The isomorphism between \({\mathcal {M}}\) and \( \mathcal {N}\) can be built by a routine backandforth construction once we establish Claim 3.1.1 below, for which we introduce the following convention:

Given an ntuple \(\overline{a}=(a_{0},\ldots ,a_{n1})\) from M (where \(n\in \omega \)), and an ntuple \(\overline{b} =(b_{0},\ldots ,b_{n1})\) from N, we write \(\overline{ a}\thicksim \overline{b}\) as a shorthand for the following statement, where \( \overline{x}\) is an ntuple:
\(\square \)
for each nary formulae \(\varphi (\overline{x})\) of \(\mathbb {L},\) \(\varphi (\overline{a})\in S_{M}\) iff \(\varphi (\overline{b})\in S_{N}.\)
Note that by Proposition 2.3, \(\overline{a}\thicksim \overline{b}\) iff for all nary formulae \(\varphi (\overline{x})\) of \(\mathbb {L},\) \( {\mathcal {M}}\models \varphi (\overline{a})\) iff \(\mathcal {N}\models \varphi ( \overline{a})\). In particular, \(\varnothing \thicksim \varnothing ,\) by condition (II) of the lemma, where \(\varnothing \) is the “0tuple”, i.e., the empty sequence.
3.1.1. Claim. Suppose \(\overline{a}\thicksim \overline{b}.\) Then:
(i) For every \(a\in M\) there is some \( b\in N\) such that \(\left( \overline{a},a\right) \thicksim \left( \overline{b},b\right) . \)
(ii) For every \(b\in N\) there is some \(a\in M\) such that \(\left( \overline{a},a\right) \thicksim \left( \overline{b},b\right) .\)
By symmetry it suffices to verify part (i) of Claim 3.1.1. Observe that since \({\mathcal {M}}\) and \(\mathcal {N}\) share the same wellfounded part W, we can fix an ordinal \(\eta \) such that \(\eta = \mathrm {o}({\mathcal {M}})=\mathrm {o}(\mathcal {N}),\) and \(N(\alpha )=M(\alpha )\) for all \(\alpha <\eta .\)
Given \(a\in M\), let
\(X:=\{\varphi (\overline{v},v):\varphi (\overline{v},v)\) is an \(\left( n+1\right) \)ary formula of \(\mathbb {L}\), and \(\varphi (\overline{a},a)\in S_{M}\}.\)
A routine argument shows that \(X\in \mathrm {Cod}_{W}({\mathcal {M}})\) (using the assumption that \(S_{M}\) is a separative \(\tau _{M}\)satisfaction class over \({\mathcal {M}}\) and \(\tau _{M}\) is a nonstandard ordinal of \( {\mathcal {M}}\)). So by assumption (I) of Lemma 3.1, \(X\in \mathrm {Cod}_{W}( \mathcal {N}).\) Hence there is some \(c\in M\) such that \(X=W\cap \mathrm {Ext}_{ \mathcal {N}}(c)\). For any \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\), consider the elements \(c_{\alpha }\) and \(d_{\alpha }\) of N, such that the following holds in \(\mathcal {N}\):
Then for each \(\alpha <\eta \), both \(c_{\alpha }\) and \(d_{\alpha }\in W.\) Also, in light of our convention of identifying W with its transitive collapse, for each \(w\in W\) we have:
The choice of \(c_{\alpha }\) and \(d_{\alpha }\) together with the compositional properties of \(S_{M}\) allows us to conclude:
(1) For all \(\alpha \in \eta \overset{\psi _{\alpha }(\overline{a}) }{~\overbrace{\left( \exists x\left( \left( \bigwedge \limits _{\varphi ( \overline{v},v)\in c_{\alpha }}\varphi (\overline{a},x)\right) \wedge \left( \bigwedge \limits _{\varphi (\overline{v},v)\in d_{\alpha }}\lnot \varphi ( \overline{a},x)\right) \right) \right) }}\in S_{M} \).
Observe that \(\psi _{\alpha }(\overline{x})\) is a formula of \( \mathbb {L}.\) Putting (1) together with the assumption \(\overline{a}\thicksim \overline{b}\) yields \(\psi _{\alpha }(\overline{b})\in S_{N}\), i.e.,
(2) For all \(\alpha \in \eta ~\left( \exists x\left( \left( \bigwedge \limits _{\varphi (\overline{v},v)\in c_{\alpha }}\varphi (\overline{ b},x)\right) \wedge \left( \bigwedge \limits _{\varphi (\overline{v},v)\in d_{\alpha }}\lnot \varphi (\overline{b},x)\right) \right) \right) \in S_{N}\) .
The key observation at this point is that there is a first order formula \(\theta (\mathrm {S},x,y,\overline{z})\) in the language of set theory augmented with the predicate S such that (2) can be reexpressed as:
(3) For all \(\alpha \in \eta ,\ (\mathcal {N},S_{N})\models \theta ( \mathrm {S},\alpha ,c,\overline{b}).\)
By invoking Overspill (Proposition 2.6) in the expanded structure \( (\mathcal {N},S_{N})\), there is some nonstandard ordinal \(\gamma \) of \(\mathcal {N}\) such \((\mathcal {N},S_{N})\models \theta (\mathrm {S,}\gamma ,c,\overline{b})\), i.e.,
(4) \((\mathcal {N},S_{N})\models \mathrm {S}\left( \exists x\left( \left( \bigwedge \limits _{\varphi (\overline{v},v)\in c_{\gamma }}\varphi ( \overline{b},x)\right) \wedge \left( \bigwedge \limits _{\varphi (\overline{v} ,v)\in d_{\gamma }}\lnot \varphi (\overline{b},x)\right) \right) \right) .\)
By coupling (4) together with the assumption that \(\left( \mathcal { N},S_{N}\right) \) satisfies condition (IV) of \(\mathrm {Sat}(\tau _{N} ,S)\) (as in Definition 2.2), the existential statement deemed true in (4) by the interpretation \(S_{N}\) of \(\mathrm {S}\) is witnessed by some \(b\in N.\) It should be clear that this is the desired element \(b\in N,\) i.e., \(\left( \overline{a},a\right) \thicksim \left( \overline{b},b\right) .\) This concludes the proof of Claim 3.1.1, and therefore of Lemma 3.1.
We now present an easy lemma (Lemma 3.2), and an old theorem of Hutchinson (Theorem 3.3); they will allow us to arrange the hypotheses of Lemma 3.1 in the proof of Theorem A.
Lemma 3.2
(ZFC) Let \(\lambda \) be a strongly inaccessible cardinal, \(S\subseteq \mathrm {V}(\lambda )\), and let
Then C is closed and unbounded in \(\lambda .\)
Proof
C is clearly closed by the elementary chain theorem, so we will concentrate on demonstrating the unboundedness of C. Fix a wellordering \(\vartriangleleft \) of \(\mathrm {V}(\lambda )\), and for any \(A\subseteq \mathrm {V}(\lambda )\), let \(\mathcal {H}(A)\) be the submodel of \(\left( \mathrm {V}(\lambda ),\in ,S\right) \) whose universe H(A) consists of the elements of \(\mathrm {V}(\lambda )\) that are first order definable in the expanded structure \(\left( \mathrm {V}(\lambda ),\in ,S,\vartriangleleft ,a\right) _{a\in A}.\) Clearly \(\left H(A)\right =\min \{\aleph _{0},\left A\right \}\), and by Tarski’s test \(\mathcal {H}(A)\prec \) \(\left( \mathrm {V}(\lambda ),\in ,S\right) .\) Given an ordinal \(\alpha <\lambda ,\) we will exhibit \(\beta \) such that \(\alpha \le \beta \in C.\) To this end, consider the sequence of models \(\left\langle {\mathcal {M}}_{n}:n\in \omega \right\rangle \) and sequence of ordinals \(\left\langle {\alpha }_{n}:n\in \omega \right\rangle \) defined by the following recursive clauses:

\({\alpha }_{0}:=\alpha ,\) and \({\mathcal {M}}_{0}:=\mathcal {H} (\alpha _{0}).\)

\(\alpha _{n+1}:=\sup \{\beta <\kappa :\beta \in M_{n}\}\), and \( {\mathcal {M}}_{n+1}:=\mathcal {H}(\mathrm {V}(\alpha _{n+1})).\)
The strong inaccessibility of \(\lambda \) guarantees that \(\mathcal { M}_{n}\) and \(\alpha _{n}\) are welldefined for each \(n\in \omega \), and that \(\left\{ {\alpha }_{n}:n\in \omega \right\} \) is bounded in \(\lambda \). Let \(\beta :=\sup \left\{ {\alpha }_{n}:n\in \omega \right\} .\) It is routine to verify that \(\alpha \le \beta \in C.\) \(\square \)
The following theorem was established by Hutchinson [11] using the omitting types theorem. As shown in [4, Theorem 2.12] this result can also be proved for models of ZFC using generic ultrapowers.
Theorem 3.3
(Hutchinson) Suppose \( \lambda \) is a regular cardinal in a countable model \(\mathcal {K}\) of ZF. Then there is an elementary extension \(\mathcal {K} ^{*}\) of \(\mathcal {K}\) satisfying the following two properties:

(a)
\(\mathcal {K}^{*}\) does not “perturb” any ordinal of \( \mathcal {K}\) that is below \(\lambda ,\) i.e., if \(\mathcal {K }\models \alpha \in \lambda \), then \(\mathrm {Ext}_{\mathcal {K} }(\alpha )=\mathrm {Ext}_{\mathcal {K}^{*}}(\alpha )\).

(b)
\(\mathrm {Ext}_{\mathcal {K}^{*}}(\lambda )\ \backslash \ \mathrm {Ext}_{\mathcal {K}}(\lambda )\), when ordered by \(\in ^{\mathcal {K}^{*}}\), has no first element (under the ordering \(\in ^{\mathcal {K}^{*}}\))
Remark 3.4
Condition (a) of Theorem 3.3 ensures that if \(k\in K\) and \(\mathcal {K}\models \left k\right <\lambda \), then \( \mathcal {K}\) does not perturb k. To see this, choose f and \(\alpha \) in K such that:
\(\mathcal {K}\models \) “\(\alpha \in \lambda \) and \(f:\alpha \rightarrow k\) and f is a bijection” .
Then since \(\mathcal {K}\prec \mathcal {K}^{*},\) \(\mathrm {Ext}_{ \mathcal {K}^{*}}(k)=\{f(x)\in K^{*}:x\in \mathrm {Ext}_{\mathcal {K} ^{*}}(\alpha )\},\) and so together with the assumption \(\mathrm {Ext}_{ \mathcal {K}^{*}}(\alpha )=\mathrm {Ext}_{\mathcal {K}}(\alpha )\), this makes it clear that \(\mathrm {Ext}_{\mathcal {K}^{*}}(k)=\mathrm {Ext}_{ \mathcal {K}}(k).\) Therefore, if \(\mathcal {K}\) is wellfounded, and \(\lambda \) is strongly inaccessible in \(\mathcal {K}\), \(\mathrm {WF}(\mathcal {K}^{*})=K(\lambda )=\mathrm {WF}(\mathcal {K}^{*}(\lambda )).\)
We are now ready to present the proof of Theorem A. Recall that \({\mathcal {M}}\) is definably wellfounded if every element of \({\mathcal {M}}\) that is first order definable in \({\mathcal {M}}\) (without parameters) is in the wellfounded part of \({\mathcal {M}}\). In particular, if \({\mathcal {M}}\) is definably wellfounded, then for any parameterfree definable \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}},\) the predecessors of \(\alpha \) form a wellordered set as viewed externally, and thus a nonstandard ordinal of \({\mathcal {M}}\) (if any) dwarfs any definable ordinal of \({\mathcal {M}}\). In particular a definably wellfounded model is an \(\omega \)model. We say that \({\mathcal {M}}\) is cofinally condensable if the collection of \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\) such that \( {\mathcal {M}}\cong \mathcal {M}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\) is unbounded in \(\mathrm {Ord}^{{\mathcal {M}}}\).
Theorem A. Assuming that \( \mathrm {ZFC} \) +“there exists an inaccessible cardinal” has a wellfounded model, there is a model \( {\mathcal {M}}\) of \(\mathrm {ZFC}\) that is both definably wellfounded and cofinally condensable.
Proof
The proof is carried out in two steps, the first takes place within an appropriately chosen model \(\mathcal {K}\) of \(\mathrm { ZFC}\); the second step is performed outside of \(\mathcal {K}\). \(\square \)
Step 1. If the theory \(\mathrm {ZFC}\) + “there exists an inaccessible cardinal” has a wellfounded model, then by the LöwenheimSkolem theorem and the fact that ZF proves that GCH holds in the constructible universe, there is a countable wellfounded model that contains a strongly inaccessible cardinal (since if \(\lambda \) is inaccessible in a model \(\mathcal {K}\), then \(\lambda \) is also inaccessible in the constructible universe \(\mathrm {L}^{\mathcal {K}}\) of \(\mathcal {K}\); and under GCH every inaccessible cardinal is strongly inaccessible). Let \( \mathcal {K}\) be a countable wellfounded model that contains a “cardinal” \(\lambda \) that is strongly inaccessible in the sense of \(\mathcal {K}\). By collapsing \(\mathcal {K}\) we may assume that \(\mathcal {K}=(K,\in ).\) By Remark 2.4 and Lemma 3.2 we can get hold of elements s and u of K satisfying the following conditions:
(i) \(\mathcal {K}\models \) “s is a separative \(\infty \)satisfaction class for \((\mathrm {V}(\lambda ),\in )\)”.
(ii) \(\mathcal {K}\models \) “u is unbounded in \(\lambda \) and \(\forall \delta \in u\) \((\mathrm {V}(\delta ),\in ,s\cap \mathrm {V}(\delta ))\prec (\mathrm {V}(\lambda ),\in ,s)\)”.
Step 2. By Theorem 3.3 and Remark 3.4, there is an elementary extension \(\mathcal {K}^{*}\) of \(\mathcal {K}\) such that \( \mathrm {WF}(\mathcal {K}^{*})=K(\lambda )=\mathrm {WF}(\mathcal {K}^{*}(\lambda )).\)
We claim that \(\mathcal {K}^{*}(\lambda )\) is definably wellfounded and cofinally condensable. \(\mathcal {K}^{*}(\lambda )\) is definably wellfounded since \(\mathcal {K}(\lambda )\prec \mathcal {K}^{*}(\lambda )\) , and \(\mathcal {K}(\lambda )\) is wellfounded. Recall that \(\mathcal {K}\) thinks that u is an unbounded subset of \(\lambda \). Since \(\mathcal {K} \prec \mathcal {K}^{*}\), to verify that \(\mathcal {K}^{*}(\lambda )\) is cofinally condensable it suffices to show that if \(\mathcal {K}^{*}\models \delta \in u\), and \(\delta \in K^{*}\backslash K\) (equivalently: \(\delta \) is a nonstandard element of \(\mathrm {Ext}_{\mathcal { K}^{*}}(u ))\), then \(\mathcal {K}^{*}(\lambda )\cong \mathcal {K} ^{*}(\delta ).\) This is precisely where Lemma 3.1 comes into the picture. If \(S:=\mathrm {Ext}_{\mathcal {K}^{*}}(s)\), then (i) and (ii) assure us that the assumptions of Lemma 3.1 are satisfied if we choose any nonstandard ordinal \(\tau _{0}\) below \(\delta \) and let:
\({\mathcal {M}}:=\mathcal {K}^{*}(\lambda ),\) \(\mathcal {N}:=\mathcal {K} ^{*}(\delta );\) \(\tau _{M}:=\tau _{0} \), \(\tau _{N}:=\tau _{0}\), \(S_{M}:=S\) and \(S_{N}:= S\cap K^{*}(\delta )\).
Hence by Lemma 3.1, \(\mathcal {K}^{*}(\lambda )\cong \mathcal {K} ^{*}(\delta )\), thus concluding the proof of Theorem A.
Remark 3.5
After seeing Theorem A Corey Switzer asked the author whether there are uncountable definably wellfounded cofinally condensable models of set theory. Assuming the existence of a weakly compact cardinal, the answer is in the positive. Here we outline the construction of such a model. Let \(\lambda \) be a weakly compact cardinal. Then if T is a theory formulated in the infinitary logic \(\mathbb {L} _{\lambda ,\lambda }\) such that \(\left T\right =\lambda \), and every subset of T of cardinality less than \(\lambda \) has a model, then T has a model. This property of \(\lambda \) can be used to show that if \( X\subseteq \mathrm {V}(\lambda ),\) then the model \((\mathrm {V}(\lambda ),\in ,X)\) has an \(\mathbb {L}_{\lambda ,\lambda }\)elementary end extension \(( \mathcal {K},X_{K})\) such that \(\mathrm {Ord}^{\mathcal {K}}\backslash \lambda \) has no least ordinal, and thus \(\mathrm {WF}(\mathcal {K)}=\mathrm {V}(\lambda ) \). In particular, \(\mathcal {K}\) is definably wellfounded. In order to ensure that \(\mathcal {K}\) is also cofinally condensable, we can choose X to be the \(\mathbb {L}_{\lambda ,\lambda }\) satisfaction class for \(\left( \mathrm {V}(\lambda ),\in \right) \). We then prove a suitable adaptation of Lemma 3.1, where the countability assumption of Lemma 3.1 is replaced with the assumption that both \({\mathcal {M}}\) and \(\mathcal {N}\) have cardinality \( \lambda \) for some strongly inaccessible \(\lambda \), \(\mathrm {WF}({\mathcal {M}} )=\mathrm {WF}(\mathcal {N})=\mathrm {V}(\lambda )\), and there are \( S_{M}\subseteq M\), \(\tau _{M}\in \mathrm {Ord}^{{\mathcal {M}}},\) \( S_{N}\subseteq M\), and \(\tau _{N}\in \mathrm {Ord}^{\mathcal {N}}\) such that \( \tau _{M}\) and \(\tau _{N}\) are respectively nonstandard cardinals of \({\mathcal {M}}\) and \(\mathcal {N}\), \(S_{M}\) satisfies Tarski’s compositional axioms over \({\mathcal {M}}\) for all formulae of the logic \(\mathbb {L}_{\delta ,\delta }^{{\mathcal {M}}}\) for \(\delta =\tau _{M}\), and \(S_{N}\) is satisfies Tarski’s compositional axioms over \(\mathcal {N}\) for all formula of the logic \(\mathbb {L}_{\delta ,\delta }^{\mathcal {N}}\) for \(\delta =\tau _{N}\). Thus \(S_{M}\) correctly calculates the truth value of all \(\mathbb {L} _{\lambda ,\lambda }\) sentences over \({\mathcal {M}}\), and \(S_{N}\) correctly calculates the truth value of all \(\mathbb {L}_{\lambda ,\lambda }\) sentences over \(\mathcal {N}\). Using an argument very similar to the proof of Theorem A, one then shows that \(\mathcal {K}\) is also cofinally condensable.
4 Proof of Theorem B
We first lay out a series of definitions and lemmas before presenting the proof of Theorem B.

Throughout the section, \({\mathcal {M}}\) is assumed to be a nonstandard model of \(\mathrm {ZF}\) and \(W:=\mathrm {WF}(\mathcal {M)}\).
Definition 4.1
A structure \(\mathcal {N}\) is \(\mathrm {Cod }_{W}({\mathcal {M}})\)saturated if for every type \(p(x,y_{1},\cdot \cdot \cdot ,y_{k})\), and for every ktuple \(\overline{a}\) of parameters from \(\mathcal {N}\), \(p(x,\overline{a})\) is realized in \(\mathcal {N}\) provided the following three conditions are satisfied:
 (i):

\(p(x,\overline{y})\subseteq \mathbb {L}_{{\mathcal {M}}}\).
 (ii):

\(p(x,\overline{y})\in \mathrm {Cod}_{W}({\mathcal {M}})\).
 (iii):

\(\forall w\in W\ \mathcal {N}\models \exists x\left( \bigwedge \limits _{\varphi \in p(x,\overline{y})\cap w}\varphi (x,\overline{a} )\right) .\)

In the interest of concision, we say that \({\mathcal {M}}\) is W saturated if \({\mathcal {M}}\) is \(\mathrm {Cod}_{W}({\mathcal {M}})\) saturated.
Remark 4.1.1. It is not hard to see that if \({\mathcal {M}}\) is \(\omega \)nonstandard, then \({\mathcal {M}}\) is Wsaturated iff \(\mathcal {M }\) is recursively saturated. We should also point out that a notion closely related to \(\mathrm {Cod}_{W}({\mathcal {M}})\)saturation was introduced in Ressayre’s paper [14] (dubbed \(\alpha \)recursive saturation) where it was used as a tool for studying the model theory of admissible languages, as well as certain aspects of descriptive set theory (see also Barwise [1, p.143], Schlipf [16, p.164–165]). A trick similar to the one that shows that recursive saturation coincides with Wsaturation for \(\omega \)nonstandard models can be used to show that, more generally, if \({\mathcal {M}}\) is nonstandard, then \({\mathcal {M}}\) is Wsaturated iff \({\mathcal {M}}\) is \(\mathrm {o }({\mathcal {M}})\)recursively saturated.
Lemma 4.2
If \(\gamma \) is a limit ordinal of \({\mathcal {M}}\) and \(\gamma \) is nonstandard, then \({\mathcal {M}}(\gamma )\) is Wsaturated.
Proof
Given a 1type \(p(x,\overline{a})\), where \( \overline{a}\) is a ktuple of parameters from \({\mathcal {M}}(\gamma )\) such that conditions (i), (ii), and (iii) of Definition 4.1 hold, choose \( c\in M(\gamma )\) such that \(p(x,\overline{y})=\mathrm {Ext}_{{\mathcal {M}} (\gamma )}(c)\cap W,\) and let \(\theta (z,\overline{y})\) be the following formula in the language of set theory augmented with a predicate \(\mathrm {S}\) :
By Remark 2.4 there is some \(s\in M\) such that \(S:=\mathrm {Ext}_{ {\mathcal {M}}}(s)\) is a separative \(\gamma \)satisfaction class on \({\mathcal {M}} (\gamma ).\) Since for all \(\alpha \in \mathrm {o}({\mathcal {M}})\), \(\left( {\mathcal {M}}(\gamma ),S\right) \) satisfies \(\theta (\alpha ,\overline{a})\) by Proposition 2.3, \(\theta (\gamma ^{\prime },\overline{a})\) holds in \(\left( {\mathcal {M}}(\gamma ),S\right) \) for some \(\gamma ^{\prime }\in \mathrm {Ord}^{ {\mathcal {M}}(\gamma )}\backslash W\) by Proposition 2.6 (Overspill), which makes it evident that \(p(x,\overline{a})\) is realized in \({\mathcal {M}}(\gamma ).\) Note that a slight modification of the proof shows that, more generally, any structure that “lives” in \({\mathcal {M}} \) (i.e., has an isomorphic copy that is coded in \({\mathcal {M}}\)) is \(\mathrm { Cod}_{W}({\mathcal {M}})\)saturated. \(\square \)
Lemma 4.3
Given countable nonstandard models \( {\mathcal {M}}\) and \(\mathcal {N}\) of \(\mathrm {ZF}\), \(\mathcal { M}\cong \mathcal {N}\) provided the following two conditions hold :

(a)
\({\mathcal {M}}\) and \(\mathcal {N}\) have the same wellfounded part W, \(\mathrm {Cod}_{W}({\mathcal {M}} )=\mathrm {Cod}_{W}({\mathcal {M}}),\) and \(\mathrm {ZF}(\mathbb {L})\subseteq \mathrm {Th}_{\mathbb {L}}\mathrm {(}\mathcal {M)}=\mathrm {Th}_{\mathbb {L}} \mathrm {(}\mathcal {N)}\) for \(\mathbb {L}:=\mathbb {L}_{{\mathcal {M}}}= \mathbb {L}_{\mathcal {N}}\).

(b)
Both \({\mathcal {M}}\) and \(\mathcal {N}\) are Wsaturated.
Proof
This lemma is a distillation of Lemma 3.1 since the proof of Claim 3.1.1 can be readily modified to show that Claim 3.1.1 holds with the assumptions of Lemma 4.3 once we make the observation that the Wsaturation of \({\mathcal {M}}\) implies that the \(\mathbb {L}\)type of any finite tuple in \({\mathcal {M}}\) is a member of \(\mathrm {Cod}_{W}(\mathcal {M })\) (and of course the same goes for \(\mathcal {N}\)). To verify this observation, first consider the following type \(p(x,\overline{y}):\)
It is easy to see that \(p(x,\overline{y})\in \mathrm {Cod}_{W}( {\mathcal {M}})\). Given \(\overline{a}\in M^{n}\) and \(\alpha \in \mathrm {o}( {\mathcal {M}})\), for sufficiently large \(\beta \in \mathrm {o}({\mathcal {M}}),\) we have:
For all \(\varphi (\overline{y})\in M(\alpha )\), \({\mathcal {M}}\models \varphi ( \overline{a})\) iff \({\mathcal {M}}\models \mathrm {Sat}_{\beta }(\varphi ( \overline{a})).\)
Together with Proposition 2.5 and the assumption that \({\mathcal {M}} \models \mathrm {ZF}(\mathbb {L})\) we conclude that for each \(\alpha \in \mathrm {o}({\mathcal {M}})\) the set \(\left\{ \varphi (\overline{y})\in M(\alpha ):{\mathcal {M}}\models \varphi (\overline{a})\right\} \) is coded in \(\mathcal {M }\). This makes it evident that the three conditions of Definition 4.1 are met and therefore by the assumption of Wsaturation of \({\mathcal {M}}\), there is an element \(c\in M\) such that for all nary \(\mathbb {L}\)formulae \(\varphi (\overline{y})\in \mathbb {L}\), we have:
\({\mathcal {M}}\models \varphi (\overline{a})\) iff \(\varphi (\overline{y})\in \mathrm {Ext}_{{\mathcal {M}}}(c),\)
which shows that the \(\mathbb {L}\)type of \(\overline{a}\) is a member of \(\mathrm {Cod}_{W}({\mathcal {M}}).\) \(\square \)
Lemma 4.4
Suppose there is an unbounded collection of \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\) such that \( \mathcal {M}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\). Then \({\mathcal {M}}\) is Wsaturated.
Proof
This directly follows from Lemma 4.2 and Proposition 2.7 (Elementary Chains). \(\square \)
Lemma 4.5
If there is some \(\alpha \in \mathrm { Ord}^{{\mathcal {M}}}\) with \(\mathcal {M}(\alpha )\prec _{\mathbb {L}_{ {\mathcal {M}}}}{\mathcal {M}}\), then \({\mathcal {M}}\models \mathrm {ZF}( \mathbb {L}_{{\mathcal {M}}})\).
Proof
Since \({\mathcal {M}}\) is assumed to be a model of \( \mathrm {ZF}\), we just need to verify that \({\mathcal {M}}\) satisfies \(\mathrm { Sep}(\mathbb {L}_{{\mathcal {M}}})\) and \(\mathrm {Coll}(\mathbb {L}_{{\mathcal {M}} }). \) In light of the assumption that \(\mathcal {M}(\alpha )\) is an \(\mathbb {L }_{{\mathcal {M}}}\)elementary submodel of \({\mathcal {M}}\), it suffices to verify that \({\mathcal {M}}(\alpha )\) satisfies \(\mathrm {Sep}(\mathbb {L}_{{\mathcal {M}} }) \) and \(\mathrm {Coll}(\mathbb {L}_{{\mathcal {M}}})\). To see that \(\mathcal {M}(\alpha )\models \mathrm {Sep}(\mathbb {L}_{{\mathcal {M}}})\), suppose \(\psi (x)\in \mathbb {L}_{{\mathcal {M}}}\) (where \(\psi (x)\) is allowed to have parameters from \(M(\alpha ))\), and \(m\in M(\alpha ).\) Consider
\(K:=\left\{ k\in M:\mathcal {M}(\alpha )\models k\in m\wedge \psi (k)\right\} .\)
By Remark 2.4, there is a separative \(\alpha \)satisfaction class S on \(\mathcal {M}(\alpha )\). Let
\(K^{\prime }:=\left\{ k\in M:\left( {\mathcal {M}}(\alpha ),S\right) \models k\in m\wedge \mathrm {S}(\psi (c_{k}))\right\} \).
By Proposition 2.3, \(K=K^{\prime }\). On the other hand, since S is separative, \(K^{\prime }\) is coded in \(\mathcal {M}(\alpha )\). This concludes the proof that \(\mathrm {Sep}(\mathbb {L}_{{\mathcal {M}}})\) holds in \( {\mathcal {M}}(\alpha )\). To verify that \({\mathcal {M}}(\alpha )\) satisfies \( \mathrm {Coll}(\mathbb {L}_{{\mathcal {M}}}),\) suppose for some \(\varphi (x,y)\in \mathbb {L}_{{\mathcal {M}}}\) and for some m in \(M{(\alpha )}\) we have:
(1) \(\mathcal {M}(\alpha )\models \forall x\in m\) \(\exists y\) \( \varphi (x,y).\)
We need to verify:
(2) \(\mathcal {M}(\alpha )\models \exists z\ \forall x\in m\) \( \exists y\in z\) \(\varphi (x,y).\)
Define f(x) in \({\mathcal {M}}\) to be the unique ordinal \(\alpha \) that satisfies \(\psi (x,\alpha ),\) where
\(\psi (x,\alpha ):=\) \(\exists y\in \mathrm {V}(\alpha )\) \(\left( \varphi (x,y)\wedge \left( \forall \beta \in \alpha \ \forall y\in \mathrm {V}(\alpha )\ \lnot \varphi (x,y)\right) \right) .\)
Note that by (1) f is welldefined in \({\mathcal {M}}\) for all \( x\in m\). To establish (2) it suffices to show:
(3) \(\mathcal {M}(\alpha )\models \exists \beta \in \mathrm {Ord\ } \forall x\in m\) \(f(x)<\beta .\)
Suppose (3) is false, then:
(4) \(\mathcal {M}(\alpha )\models \forall \beta \in \mathrm {Ord\ } \exists x\in m\) \(f(x)\ge \beta .\)
So by the assumption \(\mathcal {M}(\alpha )\prec _{\mathbb {L}_{ {\mathcal {M}}}}{\mathcal {M}}\), (4) yields:
(5) \({\mathcal {M}}\models \forall \beta \in \mathrm {Ord\ }\exists x\in m\) \(f(x)\ge \beta .\)
Pick \(\beta \in \mathrm {Ord}^{{\mathcal {M}}}\backslash \mathrm {Ord} ^{\mathcal {M}(\alpha )},\) then by (5) there is some \(m_{0}\in \mathrm {Ext}_{ {\mathcal {M}}}(m)\) (\(=\) \(\mathrm {Ext}_{\mathcal {M}}(\alpha )(m))\) such that \( f(m_{0})\ge \beta \) holds in \({\mathcal {M}}\). This contradicts \(\mathcal {M}{(\alpha )}\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) since f is an \( \mathbb {L}_{{\mathcal {M}}}\)definable function in \({\mathcal {M}}\), thereby showing the veracity of (3). This concludes the verification of \(\mathrm {Coll }(\mathbb {L}_{{\mathcal {M}}})\) in \({\mathcal {M}}.\) \(\square \)
Lemma 4.6
If \({\mathcal {M}}\) is a nonstandard model of \(\mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}})\), and \( {\mathcal {M}}\) is Wsaturated, then \({\mathcal {M}}\) is cofinally condensable.
Proof
Fix any nonstandard \(\gamma \in \mathrm {Ord}^{ {\mathcal {M}}}\) and consider the type \(p(x,\gamma )\) (where \(\gamma \) is treated as a parameter) consisting of the formula \(\left( \gamma \in x\right) \wedge \mathrm {Ord}(x)\) together with formulae of the form \(\mathrm { Ref}_{\varphi }(x)\) (as in Proposition 2.8) as \(\varphi \) ranges in \(\mathbb { L}_{{\mathcal {M}}}\). It is easy to see that p(x, y) satisfies conditions (i) and (ii) of Definition 4.1. Moreover, by Proposition 2.8 (Reflection) \( p(x,\gamma )\) also satisfies condition (iii) of Definition 4.1. Therefore by the assumption of Wsaturation of \({\mathcal {M}}\), \(p(x, \gamma ) \) is realized in \({\mathcal {M}}\) by some \(\gamma ^{\prime }\), which makes it clear that \(\gamma ^{\prime }\) is above \(\gamma ,\) \(\gamma ^{\prime }\) is a nonstandard limit ordinal of \({\mathcal {M}}\), and \(\mathcal {M}(\gamma ^{\prime })\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\). Thanks to Lemmas 4.2 and 4.3, \(\mathcal {M}(\gamma ^{\prime })\cong {\mathcal {M}}\), thus \({\mathcal {M}}\) is cofinally condensable. \(\square \)
We are now ready to establish Theorem B. The special case of Theorem B for countable \(\omega \)nonstandard models of \(\mathrm {ZF}\) follows from Schlipf’s work on recursively saturated models of \(\mathrm {ZF}\) in [17] and [18].
Theorem B. The following are equivalent for a countable model \({\mathcal {M}}\) of \(\mathrm {ZF}\).

(a)
\({\mathcal {M}}\) is condensable.

(b)
\({\mathcal {M}}\) is cofinally condensable.

(c)
\({\mathcal {M}}\) is nonstandard, and \(\mathcal {M}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \(\alpha \in \mathrm {Ord}^{{\mathcal {M}}}\).

(d)
\({\mathcal {M}}\) is nonstandard and W saturated, and \({\mathcal {M}}\models \mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}}).\)

(e)
For some nonstandard ordinal \(\gamma \) of \({\mathcal {M}}\) and some \(S\subseteq M\), S is an amenable^{Footnote 4}\(\gamma \) satisfaction class on \({\mathcal {M}}.\)
Proof
We will first show the equivalence of (a), (b) , and (c) by establishing \((b)\Rightarrow (a)\Rightarrow (c)\Rightarrow (b) \). This will allow us to show the equivalence of (d) with each of (a) , (b), and (c) by proving \((a)\Rightarrow (d)\Rightarrow (a)\). Finally, we demonstrate \((a)\Rightarrow (e)\Rightarrow (d)\) to complete the proof. \(\square \)
\(\mathbf {(b)\Rightarrow (a)}.\) Trivial.
\(\mathbf {(a)\Rightarrow (c)}.\) Suppose \({\mathcal {M}}\) is condensable with \({\mathcal {M}}\cong {\mathcal {M}}(\alpha )\prec _{\mathbb {L}_{ {\mathcal {M}}}}{\mathcal {M}}\). Then by “unwinding” the isomorphism between \({\mathcal {M}}\) and \( {\mathcal {M}}(\alpha )\), we can readily obtain a sequence of models \( \left\langle \mathcal {N}_{n}:n\in \omega \right\rangle \) such that \(\mathcal { N}_{0}={\mathcal {M}}\) and for all \(n\in \omega \) the following hold:

(1)
\(\mathcal {N}_{n}=(\mathrm {V}(\alpha _{n}),\in )^{\mathcal {N} _{n+1}}\) for some \(\alpha _{n}\in \mathrm {Ord}(\mathcal {N}_{n+1}).\)

(2)
\(\mathcal {N}_{n}\prec _{\mathbb {L}}\mathcal {N}_{n+1}\), where \( \mathbb {L}:=\mathbb {L}_{{\mathcal {M}}}\).

(3)
\(\mathcal {N}_{n}\cong {\mathcal {M}}\).
Let \(\mathcal {N}:=\bigcup \nolimits _{n\in \omega }\mathcal {N}_{n}\). By Proposition 2.7 (Elementary Chains), \(\mathcal {N}_{n}\prec _{\mathbb {L}} \mathcal {N}\) for all \(n\in \omega ,\) which together with Lemma 4.4 implies that \(\mathcal {N}\) is Wsaturated, where \(W=\mathrm {WF}(\mathcal {N})= \mathrm {WF}(\mathcal {N}_{n})\) for all \(n\in \omega .\) By Lemma 4.2, \( {\mathcal {M}}\) is also Wsaturated. Therefore \(\mathcal {N}\cong {\mathcal {M}}\) by Lemma 4.3, which in light of (2) and (3) and the unboundedness of \( \{\alpha _{n}:n\in \omega \}\) in \(\mathrm {Ord}^{\mathcal {N}}\) makes it clear that (c) holds.
\(\mathbf {(c)\Rightarrow (b)}.\) Assume (c). It is easy to see, using Proposition 2.6 and Lemma 4.2, that \({\mathcal {M}}\) is Wsaturated. By (c) we can choose a nonstandard \(\gamma \in \mathrm {Ord}^{\mathcal { M}}\) arbitrarily high in Ord\(^{{\mathcal {M}}}\) such that \({\mathcal {M}} _{\gamma }\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\). Since by Lemma 4.2 \( {\mathcal {M}}_{\gamma }\) is Wsaturated, we can now invoke Lemma 4.3 to conclude that \(\mathcal {M\cong M}_{\gamma }\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\), which makes it evident that (b) holds.
\(\mathbf {(a)\Rightarrow (d)}.\) If \(\mathcal {M}\cong \mathcal {M}{(\alpha )} \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for some \(\alpha \in \mathrm { Ord}({\mathcal {M}})\), then \({\mathcal {M}}\) is clearly nonstandard. Moreover, \( {\mathcal {M}}\) is Wsaturated by Lemma 4.2; and \({\mathcal {M}}\) satisfies \( \mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}})\) by Lemma 4.5.
\(\mathbf {(d)\Rightarrow (a)}.\) This is justified by Lemma 4.6.
\(\mathbf {(a)\Rightarrow (e)}.\) Suppose (a) holds and let \(\alpha \in \mathrm {Ord}({\mathcal {M}})\) such that \(\mathcal {M}\cong \mathcal {M}{(\alpha )}\prec _{ \mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\). By Proposition 2.5 for each \(\delta \in \mathrm {o}({\mathcal {M}}),\) there is some \(S\in M\) such that S is a \( \delta \)satisfaction predicate over \(\mathcal {M}(\alpha )\) that is definable in \(\mathcal {M}(\alpha )\) by an \(\mathbb {L}_{\mathcal {M}(\alpha )}\) formula. Since we have verified that \((a)\Rightarrow (d)\), \(\mathcal { M}{(\alpha )}\) satisfies \(\mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}})\), which assures us that S is an amenable \(\delta \)satisfaction predicate over \( \mathcal {M}(\alpha )\). Proposition 2.6 (Overspill) can be readily invoked (applied to \({\mathcal {M}}\), rather than \(({\mathcal {M}},S)\)) to show there is some nonstandard \(\gamma \) in \({\mathcal {M}}\) such that \({\mathcal {M}}\) satisfies “there is an amenable \(\gamma \)satisfaction class over \((\mathrm {V}(\alpha ),\in )\)” . In light of the assumption that \({\mathcal {M}}\cong {\mathcal {M}}(\alpha )\), this shows that (e) holds.
To carry out the overspill argument, we will distinguish between the case when \({\mathcal {M}}\) is \(\omega \)standard, and the case when \({\mathcal {M}}\) is \(\omega \)nonstandard. If \({\mathcal {M}}\) is \(\omega \)standard, the overspill argument succeeds smoothly since by routine absoluteness considerations, for \(s\in M\) and \(S:=\mathrm {Ext}_{{\mathcal {M}}}(s)\), we have:
S is amenable over \({\mathcal {M}}(\alpha )\) iff \({\mathcal {M}}\models \) “s is amenable over \(\left( \mathrm {V}(\alpha ),\in \right) \)” .
However, since the lefttoright direction of the above equivalence can break down for \(\omega \)nonstandard models (e.g., for models of \({\mathcal {M}}\) of ZF that satisfy \(\lnot \mathrm {Con(ZF)})\) we will spell out the overspill argument for the case that \({\mathcal {M}}\) is \(\omega \) nonstandard in more detail. It is worth pointing out that in this case (a) implies that \({\mathcal {M}}\) is recursively saturated, and by the resplendence property of countable recursively saturated models one can readily conclude that \({\mathcal {M}}\) carries an amenable jsatisfaction class for some nonstandard \(j\in \omega ^{{\mathcal {M}}}.\) However, the overspill argument we present establishes (e) without the assumption of countability of \({\mathcal {M}}\). Within \({\mathcal {M}}\), for each \(i\in \omega ^{ {\mathcal {M}}}\) let \(\mathrm {Repl}_{i}\mathrm {(S)}\) consist of all instances of the replacement scheme in the language {\(\in ,\mathrm {S}\)} whose length is at most i. Then define a subset S of \(\mathrm {V}(\alpha ) \) to be iamenable over \(\left( \mathrm {V}(\alpha ),\in \right) \) if \(\left( \mathrm {V}(\alpha ),\in ,S\right) \models \mathrm {Repl}_{i} \mathrm {(S)}\). Since \(\mathcal {M}(\alpha )\) is a model of ZF and for each “real world” natural number n, there is an nsatisfaction class over \(\mathcal {M}(\alpha )\) that is first order definable in \({\mathcal {M}}\), we may conclude:
(1) For each \(n\in \omega \) \({\mathcal {M}}\models \) “\(\exists s\) (s is namenable over \(\left( \mathrm {V} (\alpha ),\in \right) )\)” .
Therefore by Overspill, there is some nonstandard \(j\in \omega ^{ {\mathcal {M}}}\) such that:
(2) \({\mathcal {M}}\models \) “\(\exists s\) (s is j amenable over \(\left( \mathrm {V}(\alpha ),\in \right) )\)” .
Let \(s\in M\) be a witness to the existential statement in (2) and \( S:=\mathrm {Ext}_{{\mathcal {M}}}(s)\). It is evident that S is an amenable j satisfaction class over \({\mathcal {M}}(\alpha )\), as desired.
\(\mathbf {(e)\Rightarrow (d)}.\) The Wsaturation of \({\mathcal {M}}\) is readily verifiable with a reasoning very similar to the proof of Lemma 4.2. To see that \({\mathcal {M}}\models \mathrm {ZF}(\mathbb {L}_{{\mathcal {M}}}),\) it is sufficient to verify that the replacement scheme holds in \({\mathcal {M}}\) for all \(\mathbb {L}_{{\mathcal {M}}}\)formulae. To this end, let \(\varphi (x,y)\) be an \(\mathbb {L}_{{\mathcal {M}}}\)formula (possibly with parameters from \({\mathcal {M}}\)), and suppose that \({\mathcal {M}}\models \forall x\exists !y\varphi (x,y).\) Let \(f:M\rightarrow M\) be the function whose graph is described by \(\varphi .\) Given \(c\in M,\) we want to show that there is \(d\in M\) such that
By Proposition 2.3 the graph of f is also given by the formula \( \theta (x,y,\varphi ):=\mathrm {S}(\varphi (c_{x},c_{y}))\) (where \(\varphi \) is treated as a parameter). The assumption that \(({\mathcal {M}},S)\models \mathrm {Repl(S)}\) then allows us to get hold of \(d\in M\) such that \(\mathrm { Ext}_{{\mathcal {M}}}(d)=\{f(m):m\in \mathrm {Ext}_{{\mathcal {M}}}(c)\}.\)
Remark 4.7
An examination of the proof of Theorem B makes it clear that the following implications hold without the assumption of countability of \({\mathcal {M}}\):
We suspect that the implication \((a)\Rightarrow (b)\) fails for some uncountable model of ZF, but we have not been able to verify this. However, the remaining two implications can be shown to be irreversible by resorting to wellknown uncountable models, as we shall explain.
The failure of \((e)\Rightarrow (a)\) is illustrated by the easily verified fact that there are \(\omega _{1}\)like recursively saturated models of ZF: start with a countable recursively saturated model \({\mathcal {M}}_{0}\) of ZF and let \(S_{0}\) be an amenable jsatisfaction class \(S_{0}\) for some nonstandard \(j\in \omega ^{{\mathcal {M}}}\). Then use the KeislerMorley Theorem^{Footnote 5} to build an \(\omega _{1}\)like elementary end extension \(({\mathcal {M}} ,S) \) of \(({\mathcal {M}}_{0},S_{0})\). It is evident that \({\mathcal {M}}\) is recursively saturated but not condensable.
The failure of \((c)\Rightarrow (e)\) is illustrated by the fact that there are \(\omega _{1}\)like rather classless recursively saturated models of ZF; this fact was first established by Matt Kaufmann [13] using the combinatorial principle \(\Diamond _{\omega _{1}}\); later Shelah [19] used an absoluteness argument to eliminate \( \Diamond _{\omega _{1}}\) (but no “direct proof” of this fact has been yet discovered). Note that by Tarski’s theorem on undefinability of truth, a rather classless model cannot even carry a separative \(\gamma \)satisfaction class for nonstandard \(\gamma \).^{Footnote 6}
It is also worth pointing out that the equivalence of condition (a) through (d) of Theorem B holds for models of ZF of arbitrary cardinality provided “condensable” is replaced by “weakly condensable” , where \({\mathcal {M}}\) is said to be weakly condensable if \(\mathcal {M}\ {\cong }_{p}\ \mathcal {M}{(\alpha )}\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for some \(\alpha \in \mathrm {Ord}({\mathcal {M}})\); here \(\mathcal {\cong }_{p}\) denotes partial isomorphism (two relational structures are said to be partially isomorphic if there is a nonempty family of partial isomorphisms between them that has the backandforth property, see [1]).
Remark 4.8
Condensability is a robust notion, as indicated by (1) and (2) below.
(1) It is easy to see, using the definition of condensability, that condensability is inherited by inner models (by an inner model of a model \({\mathcal {M}}\) of ZF here we mean a transitive subclass of \({\mathcal {M}}\) that satisfies ZF, contains all the ordinals of \({\mathcal {M}}\), and is definable in \({\mathcal {M}}\) by an \(\mathbb {L}_{{\mathcal {M}}}\)formula).
(2) The equivalence of (a) and (c) of Theorem B can be used to show that if \({\mathcal {M}}\) is a condensable model of \(\mathrm {ZF}\), and \( \mathbb {P}\) is setnotion of forcing in \({\mathcal {M}}\), then for every \(\mathbb {P}\)generic filter G over \({\mathcal {M}}\), \({\mathcal {M}}[G]\) is also condensable (the proof is similar to the special case when \(\mathcal { M}\) is recursively saturated, as in the proof of Theorem 2.6 of [5]). The situation is quite different for class notions of forcing, since as shown in Theorem 2.8 of [6] every countable model of ZF has a classgeneric extension to a Paris model of ZF, and of course no Paris model is condensable.
Notes
This follows from the following facts: (1) Every countable extension of ZF has a Paris model, i.e., a model every ordinal of which is pointwise definable; (2) No Paris model of ZF can be rank extended to a model of KripkePlatek set theory that has a first new ordinal; see Theorems 1.2 and 3.11 of [6].
Theorem 1.1 can be readily derived from the following two key results of Barwise and Schlipf:
(a) Every resplendent model of ZF is cofinally condensable [17, Corollary 3.3]. (b) Every countable recursively saturated model is resplendent [2]. It is worth pointing out that the assumption of countability in Theorem 1.1 cannot be dropped since it is wellknown that every consistent extension of ZF has an \(\aleph _{1}\)like recursively saturated model (as elaborated in Remark 4.7). On the other hand, in light of the resplendence property of special models (attributed to Chang and Moschovakis in [2][Example 2.3]), every saturated model of ZF is cofinally condensable (it is wellknown that ZFC proves that a saturated model of ZF of cardinality \(\kappa \) exists iff ZF is consistent and \(\kappa \) is an uncountable cardinal such that \(\kappa ^{<\kappa }=\kappa ).\)
The Reflection Theorem is often formulated as a theorem scheme of ZF (e.g., as in [12]), but it is wellknown that the proof strategy of the Reflection Theorem applies equally well to the extension \(\mathrm {ZF}( \mathcal {L})\) of ZF (where \(\mathcal {L}\) extends the language of set theory) in which the schemes of separation and collection are extended to \(\mathcal {L}\)formulae.
This notion was defined in Definition 2.2.
The KeislerMorley Theorem is often stated for countable models of ZF, but the usual omitting types proof of the theorem (as in [3, Theorem 2.2.18]) works for equally well for all countable models \(({\mathcal {M}},S)\), where \({\mathcal {M}}\) is a model of \(\mathrm {ZF}\) and S is amenable over \({\mathcal {M}}\).
Indeed by a theorem of Smith [20], no rather classless model \( {\mathcal {M}}\) carries a jsatisfaction class for any nonstandard \(j\in \omega ^{{\mathcal {M}}}.\) Smith’s result was formulated for models of PA, but his proof works equally well for models of ZF.
References
Barwise, J.: Admissible sets and structures, perspectives in mathematical logic. Springer, Verlag (1975)
Barwise, J., Schlipf, J.: An introduction to recursively saturated and resplendent models. J. Sym. Logic 41, 531–536 (1976)
Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. NorthHolland publishing Co., Amsterdam (1990)
Enayat, A.: On certain elementary extensions of models of set theory. Trans. Amer. Math. Soc. 283, 705–715 (1984)
Enayat, A.: Counting models of set theory. Fund. Math. 174, 23–47 (2002)
Enayat, A.: Models of set Theory with definable ordinals. Arch. Math. Logic 44, 363–385 (2005)
Enayat, A., McKenzie, Z.: Initial embeddings of models of set theory, under review (2019). Available online: http://front.math.ucdavis.edu/1906.02873
Friedman, H.: Countable models of set theories. Lecture Notes in Mathematics, vol. 337, pp. 539–573. Springer, Berlin (1973)
Gorbow, P.K.: Selfsimilarity in the Foundations, Doctoral Dissertation, University of Gothenburg (2018). Available online: arXiv:1806.11310
Gorbow, P.K.: Rankinitial embeddings of nonstandard models of set theory. Arch. Math. Logic 59, 517–563 (2020)
Hutchinson, J.: Elementary extensions of countable models of set theory. J. Sym. Logic 41, 139–145 (1976)
Jech, T.: Set Theory. Springer Monographs in Mathematics. Springer, Berlin (2003)
Kaufmann, M.: A rather classless model. Proc. Amer. Math. Soc. 62, 330–333 (1977)
Ressayre, J.P.: Models with compactness properties relative to an admissible language. Ann. Pure Appl. Logic 11, 31–55 (1977)
Ressayre, J.P.: Modèles non standard et soussystèmes remarquables de ZF, Modéles Non standard en Arithmétique et Théorie des Ensembles, Publications Math ématiques de l’Université Paris VII. Vol. 22. Université de Paris VII, U.E.R. de Mathématiques, Paris, pp. 47–147 (1987)
Schlipf, J.: A guide to the identification of admissible sets above structures. Ann. Pure Appl. Logic 12, 151–192 (1977)
Schlipf, J.: Toward model theory through recursive saturation. J. Sym. Logic 43, 183–206 (1978)
Schlipf, J.: Recursively saturared models of set theory. Proc. Amer. Math. Soc. 80, 135–142 (1980)
Shelah, S.: Models with second order properties II: trees with no undefined branches. Ann. Pure Appl. Logic 14, 73–87 (1978)
Smith, S.T.: Nonstandard definability. Ann. Pure Appl. Logic 42, 21–43 (1989)
Acknowledgements
I am grateful to Paul Kindvall Gorbow, Zachiri McKenzie, and Jim Schmerl for their feedback on earlier versions of this paper. Special thanks also go to the referee for a most helpful report.
Funding
Open access funding provided by University of Gothenburg. The research presented in this article was partially supported by the National Science Centre, Poland (NCN), grant number 2019/34/A/HS1/00399.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Enayat, A. Condensable models of set theory. Arch. Math. Logic 61, 299–315 (2022). https://doi.org/10.1007/s00153021007863
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153021007863