Aronszajn tree preservation and bounded forcing axioms

Journal of Symbolic Logic 86 (1):293-315 (2021)
  Copy   BIBTEX

Abstract

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma $ : the hierarchy of bounded forcing axioms, of $\Sigma ^1_1$ -absoluteness, and of Aronszajn tree preservation principles. The latter principle at level $\kappa $ says that whenever T is a tree of height $\omega _1$ and width $\kappa $ that does not have a branch of order type $\omega _1$, and whenever ${\mathord {\mathbb P}}$ is a forcing notion in $\Gamma $, then it is not the case that ${\mathord {\mathbb P}}$ forces that T has such a branch. $\Sigma ^1_1$ -absoluteness serves as an intermediary between these principles and the bounded forcing axioms. A special case of the main result is that for forcing classes that don’t add reals, the three principles at level $2^\omega $ are equivalent. Special attention is paid to certain subclasses of subcomplete forcing, since these are natural forcing classes that don’t add reals.

Links

PhilArchive



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

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

Specializing Aronszajn Trees with Strong Axiom A and Halving.Heike Mildenberger & Saharon Shelah - 2019 - Notre Dame Journal of Formal Logic 60 (4):587-616.
Hierarchies of resurrection axioms.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):283-325.
Gap structure after forcing with a coherent Souslin tree.Carlos Martinez-Ranero - 2013 - Archive for Mathematical Logic 52 (3-4):435-447.
Bounded forcing axioms and the continuum.David Asperó & Joan Bagaria - 2001 - Annals of Pure and Applied Logic 109 (3):179-203.
Projective well-orderings and bounded forcing axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557-572.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
Creatures on ω 1 and weak diamonds.Heike Mildenberger - 2009 - Journal of Symbolic Logic 74 (1):1-16.
Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
A forcing axiom for a non-special Aronszajn tree.John Krueger - 2020 - Annals of Pure and Applied Logic 171 (8):102820.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.

Analytics

Added to PP
2021-02-02

Downloads
12 (#1,110,155)

6 months
7 (#486,539)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Diagonal reflections on squares.Gunter Fuchs - 2019 - Archive for Mathematical Logic 58 (1-2):1-26.
Closure properties of parametric subcompleteness.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (7-8):829-852.

View all 8 references / Add more references