Constructible models of subsystems of ZF

Journal of Symbolic Logic 45 (2):237-250 (1980)
  Copy   BIBTEX

Abstract

One of the main results of Gödel [4] and [5] is that, if M is a transitive set such that $\langle M, \epsilon \rangle$ is a model of ZF (Zermelo-Fraenkel set theory) and α is the least ordinal not in M, then $\langle L_\alpha, \epsilon \rangle$ is also a model of ZF. In this note we shall use the Jensen uniformisation theorem to show that results analogous to the above hold for certain subsystems of ZF. The subsystems we have in mind are those that are formed by restricting the formulas in the separation and replacement axioms to various levels of the Levy hierarchy. This is all done in § 1. In § 2 we proceed to establish the exact order relationships which hold among the ordinals of the minimal models of some of the systems discussed in § 1. Although the proofs of these latter results will not require any use of the uniformisation theorem, we will find it convenient to use some of the more elementary results and techniques from Jensen's fine-structural theory of L. We thus provide a brief review of the pertinent parts of Jensen's works in § 0, where a list of general preliminaries is also furnished. We remark that some of the techniques which we use in the present paper have been used by us previously in [6] to prove various results about β-models of analysis. Since β-models for analysis are analogous to transitive models for set theory, this is not surprising

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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

Bi-interpretation in weak set theories.Alfredo Roque Freire & Joel David Hamkins - 2021 - Journal of Symbolic Logic 86 (2):609-634.
A partial model of NF with ZF.Nando Prati - 1993 - Mathematical Logic Quarterly 39 (1):274-278.
Leibnizian models of set theory.Ali Enayat - 2004 - Journal of Symbolic Logic 69 (3):775-789.
Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
Complete topoi representing models of set theory.Andreas Blass & Andre Scedrov - 1992 - Annals of Pure and Applied Logic 57 (1):1-26.
Generic coding with help and amalgamation failure.Sy-David Friedman & Dan Hathaway - 2021 - Journal of Symbolic Logic 86 (4):1385-1395.
Bounded finite set theory.Laurence Kirby - 2021 - Mathematical Logic Quarterly 67 (2):149-163.

Analytics

Added to PP
2009-01-28

Downloads
35 (#720,799)

6 months
7 (#614,157)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & Hartley Rogers, Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 113--170.
A note on constructible sets of integers.Hilary Putnam - 1963 - Notre Dame Journal of Formal Logic 4 (4):270-273.
Groups of small Morley rank.Gregory Cherlin - 1979 - Annals of Mathematical Logic 17 (1):1.
The next admissible ordinal.Richard Gostanian - 1979 - Annals of Mathematical Logic 17 (1):171.

Add more references