Condensable models of set theory

Archive for Mathematical Logic 61 (3):299-315 (2022)
  Copy   BIBTEX

Abstract

A model \ of ZF is said to be condensable if \\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\) for some “ordinal” \, where \:=,\in )^{{\mathcal {M}}}\) and \ is the set of formulae of the infinitary logic \ that appear in the well-founded part of \. The work of Barwise and Schlipf in the 1970s revealed the fact that every countable recursively saturated model of ZF is cofinally condensable \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \). Moreover, it can be readily shown that any \-nonstandard condensable model of \ is recursively saturated. These considerations provide the context for the following result that answers a question posed to the author by Paul Kindvall Gorbow.Theorem A. Assuming a modest set-theoretic hypothesis, there is a countable model \ of ZFC that is both definably well-founded is in the well-founded part of \}\) and cofinally condensable. We also provide various equivalents of the notion of condensability, including the result below.Theorem B. The following are equivalent for a countable model \ of \: \ is condensable. \ is cofinally condensable. \ is nonstandard and \\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \.

Links

PhilArchive



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

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

An example related to Gregory’s Theorem.J. Johnson, J. F. Knight, V. Ocasio & S. VanDenDriessche - 2013 - Archive for Mathematical Logic 52 (3-4):419-434.
The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Syntax and Semantics of the Logic $\mathcal{L}^\lambda_{\omega\omega}$.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.
Fully Fregean logics.Sergei Babyonyshev - 2003 - Reports on Mathematical Logic:59-77.
The model theory of modules of a C*-algebra.Camilo Argoty - 2013 - Archive for Mathematical Logic 52 (5-6):525-541.
Why is $$\mathcal{CPT}$$ Fundamental?O. W. Greenberg - 2006 - Foundations of Physics 36 (10):1535-1553.
Some remarks on category of the real line.Kyriakos Keremedis - 1999 - Archive for Mathematical Logic 38 (3):153-162.
Classical Modal De Morgan Algebras.Sergio A. Celani - 2011 - Studia Logica 98 (1-2):251-266.
Observables and Statistical Maps.Stan Gudder - 1999 - Foundations of Physics 29 (6):877-897.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Rudimentary Recursion, Gentle Functions and Provident Sets.A. R. D. Mathias & N. J. Bowler - 2015 - Notre Dame Journal of Formal Logic 56 (1):3-60.

Analytics

Added to PP
2021-08-07

Downloads
8 (#1,249,165)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Set theoretical analogues of the Barwise-Schlipf theorem.Ali Enayat - 2022 - Annals of Pure and Applied Logic 173 (9):103158.
The Copernican Multiverse of Sets.Paul K. Gorbow & Graham E. Leigh - 2022 - Review of Symbolic Logic 15 (4):1033-1069.

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.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.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.

View all 13 references / Add more references