Dependent choice, properness, and generic absoluteness

Review of Symbolic Logic:1-25 (forthcoming)
  Copy   BIBTEX

Abstract

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of large cardinals. We also investigate some basic consequences of the Proper Forcing Axiom in $\mathsf {ZF}$, and formulate a natural question about the generic absoluteness of the Proper Forcing Axiom in $\mathsf {ZF}+\mathsf {DC}$ and $\mathsf {ZFC}$. Our results confirm $\mathsf {ZF} + \mathsf {DC}$ as a natural foundation for a significant portion of “classical mathematics” and provide support to the idea of this theory being also a natural foundation for a large part of set theory.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

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

Generic absoluteness.Joan Bagaria & Sy D. Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
Generic absoluteness.Joan Bagaria & Sy Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
Absoluteness via resurrection.Giorgio Audrito & Matteo Viale - 2017 - Journal of Mathematical Logic 17 (2):1750005.
On generic extensions without the axiom of choice.G. P. Monro - 1983 - Journal of Symbolic Logic 48 (1):39-52.
Generic Σ₃¹ Absoluteness.Sy D. Friedman - 2004 - Journal of Symbolic Logic 69 (1):73 - 80.
Generic Σ3 1 absoluteness.Sy D. Friedman - 2004 - Journal of Symbolic Logic 69 (1):73-80.
Strong logics of first and second order.Peter Koellner - 2010 - Bulletin of Symbolic Logic 16 (1):1-36.
Universally baire sets and generic absoluteness.Trevor M. Wilson - 2017 - Journal of Symbolic Logic 82 (4):1229-1251.
Subcomplete forcing, trees, and generic absoluteness.Gunter Fuchs & Kaethe Minden - 2018 - Journal of Symbolic Logic 83 (3):1282-1305.
Solovay models and forcing extensions.Joan Bagaria & Roger Bosch - 2004 - Journal of Symbolic Logic 69 (3):742-766.
Infinite Forcing and the Generic Multiverse.Giorgio Venturi - 2020 - Studia Logica 108 (2):277-290.
Parameterized partition relations on the real numbers.Joan Bagaria & Carlos A. Di Prisco - 2009 - Archive for Mathematical Logic 48 (2):201-226.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.

Analytics

Added to PP
2020-07-03

Downloads
32 (#501,769)

6 months
9 (#314,693)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

David Aspero
University of East Anglia

Citations of this work

Determinacy and regularity properties for idealized forcings.Daisuke Ikegami - 2022 - Mathematical Logic Quarterly 68 (3):310-317.

Add more citations

References found in this work

Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
Suitable extender models I.W. Hugh Woodin - 2010 - Journal of Mathematical Logic 10 (1):101-339.
Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.

View all 11 references / Add more references