Definability of Satisfaction in Outer Models

In Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo (eds.), The Hyperuniverse Project and Maximality. Basel, Switzerland: Birkhäuser. pp. 135-160 (2018)
  Copy   BIBTEX

Abstract

Let M be a transitive model of ZFC. We say that a transitive model of ZFC, N, is an outer model of M if M ⊆ N and ORD ∩ M = ORD ∩ N. The outer model theory of M is the collection of all formulas with parameters from M which hold in all outer models of M. Satisfaction defined with respect to outer models can be seen as a useful strengthening of first-order logic. Starting from an inaccessible cardinal κ, we show that it is consistent to have a transitive model M of ZFC of size κ in which the outer model theory is lightface definable, and moreover M satisfies V = HOD. The proof combines the infinitary logic L∞,ω, Barwise’s results on admissible sets, and a new forcing iteration of length strictly less than κ+ which manipulates the continuum function on certain regular cardinals below κ. In the Appendix, we review some unpublished results of Mack Stanley which are directly related to our topic.

Links

PhilArchive



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

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

Definability of satisfaction in outer models.Sy-David Friedman & Radek Honzik - 2016 - Journal of Symbolic Logic 81 (3):1047-1068.
Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
Large cardinals and gap-1 morasses.Andrew D. Brooke-Taylor & Sy-David Friedman - 2009 - Annals of Pure and Applied Logic 159 (1-2):71-99.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.
Minimum models of second-order set theories.Kameryn J. Williams - 2019 - Journal of Symbolic Logic 84 (2):589-620.
Complete topoi representing models of set theory.Andreas Blass & Andre Scedrov - 1992 - Annals of Pure and Applied Logic 57 (1):1-26.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Forcing with Non-wellfounded Models.Paul Corazza - 2007 - Australasian Journal of Logic 5:20-57.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
The model N = ∪ {L[A]: A countable set of ordinals}.Claude Sureson - 1987 - Annals of Pure and Applied Logic 36:289-313.
Localizing the axioms.Athanassios Tzouvaras - 2010 - Archive for Mathematical Logic 49 (5):571-601.

Analytics

Added to PP
2020-06-17

Downloads
9 (#1,224,450)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references