Blunt and topless end extensions of models of set theory

Journal of Symbolic Logic 48 (4):1053-1073 (1983)
  Copy   BIBTEX

Abstract

Let U be a well-founded model of ZFC whose class of ordinals has uncountable cofinality, such that U has a Σ n end extension for each n ∈ ω. It is shown in Theorem 1.1 that there is such a model which has no elementary end extension. In the process some interesting facts about topless end extensions (those with no least new ordinal) are uncovered, for example Theorem 2.1: If U is a well-founded model of ZFC, such that U has uncountable cofinality and U has a topless Σ 3 end extension, then U has a topless elementary end extension and also a well-founded elementary end extension, and contains ordinals which are (in U) highly hyperinaccessible. In § 3 related results are proved for κ-like models (κ any regular cardinal) which need not be well founded. As an application a soft proof is given of a theorem of Schmerl on the model-theoretic relation κ → λ. (The author has been informed that Silver had earlier, independently, found a similar unpublished proof of that theorem.) Also, a simpler proof is given of (a generalization of) a characterization by Keisler and Silver of the class of well-founded models which have a Σ n end extension for each n ∈ ω. The case κ = ω 1 is investigated more deeply in § 4, where the problem solved by Theorem 1.1 is considered for non-well-founded models. In Theorems 4.1 and 4.4, ω 1 -like models of ZFC are constructed which have a Σ n end extension for all n ∈ ω but have no elementary end extension. ω 1 -like models of ZFC which have no Σ 3 end extension are produced in Theorem 4.2. The proof uses a notion of satisfaction class, which is also applied in the proof of Theorem 4.6: No model of ZFC has a definable end extension which satisfies ZFC. Finally, Theorem 5.1 generalizes results of Keisler and Morley, and Hutchinson, by asserting that every model of ZFC of countable cofinality has a topless elementary end extension. This contrasts with the rest of the paper, which shows that for well-founded models of uncountable cofinality and for κ-like models with κ regular, topless end extensions are much rarer than blunt end extensions

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

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

Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
On Keisler singular‐like models.Shahram Mohsenipour - 2008 - Mathematical Logic Quarterly 54 (3):330-336.
A model of peano arithmetic with no elementary end extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.
Model theory of the inaccessibility scheme.Shahram Mohsenipour - 2011 - Archive for Mathematical Logic 50 (7-8):697-706.
The σ1-definable universal finite sequence.Joel David Hamkins & Kameryn J. Williams - 2022 - Journal of Symbolic Logic 87 (2):783-801.

Analytics

Added to PP
2009-01-28

Downloads
265 (#101,150)

6 months
9 (#482,469)

Historical graph of downloads
How can I increase my downloads?