We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper we will show that for every cut I of any countable nonstandard model $\mathcal {M}$ of $\mathrm {I}\Sigma _{1}$, each I-small $\Sigma _{1}$-elementary submodel of $\mathcal {M}$ is of the form of the set of fixed points of some proper initial self-embedding of $\mathcal {M}$ iff I is a strong cut of $\mathcal {M}$. Especially, this feature will provide us with some equivalent conditions with the strongness of the standard cut in a given countable model $\mathcal {M}$ of $ \mathrm {I}\Sigma _{1} $. In addition, we will find some criteria for extendability of initial self-embeddings of countable nonstandard models of $ \mathrm {I}\Sigma _{1} $ to larger models.
By a classical theorem of Harvey Friedman (1973), every countable nonstandard model
$\mathcal {M}$
of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of
$\mathcal {M}$
such that
$j[\mathcal {M}]\subsetneq \mathcal {M}$
, and the ordinal rank of each member of
$j[\mathcal {M}]$
is less than the ordinal rank of each element of
$\mathcal {M}\setminus j[\mathcal {M}]$
. Here, we investigate the larger family of proper initial-embeddings j of models
$\mathcal {M}$
of fragments of set theory, where the image of j is a transitive submodel of
$\mathcal {M}$
. Our results include the following three theorems. In what follows,
$\mathrm {ZF}^-$
is
$\mathrm {ZF}$
without the power set axiom;
$\mathrm {WO}$
is the axiom stating that every set can be well-ordered;
$\mathrm {WF}(\mathcal {M})$
is the well-founded part of
$\mathcal {M}$
; and
$\Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $
is the full scheme of dependent choice of length
$\alpha $
.
Theorem A.
There is an
$\omega $
-standard countable nonstandard model
$\mathcal {M}$
of
$\mathrm {ZF}^-+\mathrm {WO}$
that carries no initial self-embedding
$j:\mathcal {M} \longrightarrow \mathcal {M}$
other than the identity embedding.
Theorem B.
Every countable
$\omega $
-nonstandard model
$\mathcal {M}$
of
$\ \mathrm {ZF}$
is isomorphic to a transitive submodel of the hereditarily countable sets of its own constructible universe
$L^{\mathcal {M}}$
.
Theorem C.
The following three conditions are equivalent for a countable nonstandard model
$\mathcal {M}$
of
$\mathrm {ZF}^{-}+\mathrm {WO}+\forall \alpha \ \Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $
.
(I) There is a cardinal in
$\mathcal {M}$
that is a strict upper bound for the cardinality of each member of
$\mathrm {WF}(\mathcal {M})$
.
(II)
$\mathrm {WF}(\mathcal {M})$
satisfies the powerset axiom.
(III) For all
$n \in \omega $
and for all
$b \in M$
, there exists a proper initial self-embedding
$j: \mathcal {M} \longrightarrow \mathcal {M}$
such that
$b \in \mathrm {rng}(j)$
and
$j[\mathcal {M}] \prec _n \mathcal {M}$
.
We solve a longstanding question of Rosenstein, and make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding.
The precise characterization of those computable linear orderings which have computable copies without nontrivial computable self-embedding remains open.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.