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

Archive for Mathematical Logic 59 (5-6):517-563 (2020)
  Copy   BIBTEX

Abstract

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 existence of rank-initial embeddings between countable non-standard models of the fragment \ + \-Separation of \; and Gaifman’s technique of iterated ultrapowers is employed to show that any countable model of \ can be elementarily rank-end-extended to models with well-behaved automorphisms whose sets of fixed points equal the original model. These theoretical developments are then utilized to prove various results relating self-embeddings, automorphisms, their sets of fixed points, strong rank-cuts, and set theories of different strengths. Two examples: The notion of “strong rank-cut” is characterized in terms of the theory \, and in terms of fixed-point sets of self-embeddings.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Guessing models and generalized Laver diamond.Matteo Viale - 2012 - Annals of Pure and Applied Logic 163 (11):1660-1678.
Categoricity and U-rank in excellent classes.Olivier Lessmann - 2003 - Journal of Symbolic Logic 68 (4):1317-1336.
Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
A model and its subset.Ludomir Newelski - 1992 - Journal of Symbolic Logic 57 (2):644-658.
Simple groups and the number of countable models.Predrag Tanović - 2013 - Archive for Mathematical Logic 52 (7-8):779-791.
Constructing ω-stable structures: Rank 2 fields.John T. Baldwin & Kitty Holland - 2000 - Journal of Symbolic Logic 65 (1):371-391.

Analytics

Added to PP
2019-11-15

Downloads
13 (#973,701)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.
The Copernican Multiverse of Sets.Paul K. Gorbow & Graham E. Leigh - 2022 - Review of Symbolic Logic 15 (4):1033-1069.
End extending models of set theory via power admissible covers.Zachiri McKenzie & Ali Enayat - 2022 - Annals of Pure and Applied Logic 173 (8):103132.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
Set Theory.T. Jech - 2005 - Bulletin of Symbolic Logic 11 (2):243-245.
Model Theory.C. C. Chang & H. Jerome Keisler - 1992 - Studia Logica 51 (1):154-155.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.

View all 19 references / Add more references