# Rank-initial embeddings of non-standard models of set theory

@article{Gorbow2020RankinitialEO, title={Rank-initial embeddings of non-standard models of set theory}, author={Paul K. Gorbow}, journal={Arch. Math. Log.}, year={2020}, volume={59}, pages={517-563} }

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then combined into a “geometric technique” used to prove several results about countable non-standard models of set theory. In particular, back-and-forth constructions are carried out to establish various generalizations and refinements of Friedman’s theorem on the… Expand

#### Topics from this paper

#### 3 Citations

End extending models of set theory via power admissible covers

- Mathematics
- 2021

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of… Expand

THE COPERNICAN MULTIVERSE OF SETS

- Mathematics
- 2020

We develop an untyped semantic framework for the multiverse of set theory and show that its proof-theoretic commitments are mild. $\mathsf{ZF}$ is extended with semantical axioms utilizing the new… Expand

Condensable models of set theory

- Mathematics
- 2019

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" o of M such that the rank initial segment of M determined by o is both isomorphic to M, and also an… Expand

#### References

SHOWING 1-10 OF 47 REFERENCES

Self-similarity in the Foundations

- Mathematics, Computer Science
- The Bulletin of Symbolic Logic
- 2019

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory, and the formulation of a novel algebraic set theory which is proved to be equiconsistent to New Foundations, and which can be modulated to correspond to intuitionistic or classical NF. Expand

Every Countable Model of Set Theory embeds into its Own Constructible Universe

- Mathematics, Computer Science
- J. Math. Log.
- 2013

It is shown that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe, and there is an embedding $j:M to L^M$ that is elementary for quantifier-free assertions. Expand

Automorphisms of models of arithmetic: A unified view

- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2007

The method of iterated ultrapower representation is developed to provide a unified and perspicuous approach for building automorphisms of countable recursively saturated models of Peano arithmetic PA, and is used to prove Theorem A below, which confirms a long-standing conjecture of James Schmerl. Expand

Fixed Points of Self-embeddings of Models of Arithmetic

- Mathematics
- 2017

We investigate the structure of fixed point sets of self-embeddings of models of arithmetic. In particular, given a countable nonstandard model M of a modest fragment of Peano arithimetic, we provide… Expand

Automorphisms , Mahlo Cardinals , and NFU

- 2004

In this paper we establish an intimate relationship between Mahlo cardinals and automorphisms of models of set theory. The models of set theory involved here are not well-founded since a routine… Expand

Largest initial segments pointwise fixed by automorphisms of models of set theory

- Mathematics, Computer Science
- Arch. Math. Log.
- 2018

The main achievement is the calculation of the theory of the Theory of C of structures of the form C as precisely MOST-Δ0P-MOST, a recursively saturated model of MOST that is closed under exponentiation and contains $\omega ^\mathcal {M}$$ωM. Expand

Power-like models of set theory

- Computer Science, Mathematics
- Journal of Symbolic Logic
- 2001

A corollary of the classical theorem of Keisler and Morley on elementary end extensions of models of set theory is that every consistent extension of ZF has an ℵ1-like model, and here this implies that if θ is a regular cardinal 0 such that 2<0 = 0 then every consistent Extension of ZFC also has a 0+- like model. Expand

Toward Model Theory Through Recursive Saturation

- Mathematics, Computer Science
- J. Symb. Log.
- 1978

This paper studies parallels of recursively saturated models of ZF set theory and PA (Peano arithmetic), showing how they can be exploited to give new proofs of some traditional model theoretic theorems. Expand

Automorphisms of Recursively Saturated Models of Arithmetic

- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 1991

The main result is a characterisation of strong elementary initial segments of M as the initial segments consisting of fixed points of automorphisms of M. Expand

ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES

- Mathematics, Computer Science
- The Journal of Symbolic Logic
- 2018

Theorems A and B above can be recast as theorem schemes in ZFC, or as asserting that a single statement in the language of class theory holds in all ‘spartan’ models of GB (Gödel-Bernays class theory). Expand