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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.
Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
The Structural Complexity of Models of Arithmetic.Antonio Montalbán & Dino Rossegger - 2024 - Journal of Symbolic Logic 89 (4):1703-1719.
Tanaka’s theorem revisited.Saeideh Bahrami - 2020 - Archive for Mathematical Logic 59 (7-8):865-877.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.

Analytics

Added to PP
2019-11-15

Downloads
21 (#1,005,339)

6 months
7 (#706,906)

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

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.
Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

View all 16 references / Add more references