Subcomplete forcing, trees, and generic absoluteness

DOI10.1017/JSL.2018.23MaRDI QIDQ4692091zbMATH OpenOpenAlexWikidataFDO

Authors Gunter Fuchs, Kaethe Minden

Publication date 26 October 2018

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.08170

zbMATH Keywords

continuum hypothesisforcing axiomsgeneric absolutenessSuslin treessubcomplete forcing

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Continuum hypothesis and Martin's axiom (03E50) Generic absoluteness and forcing axioms (03E57)

Abstract: We investigate properties of trees of height $omeg{a}_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $omeg{a}_1$-tree. We introduce fragments of subcompleteness which are preserved by subcomplete forcing, and use these in order to show that certain strong forms of rigidity of Suslin trees are preserved by subcomplete forcings. Finally, we explore under what circumstances subcomplete forcing preserves Aronszajn trees of height and width $omeg{a}_1$. We show that this is the case if CH fails, and if CH holds, then this is the case iff the bounded subcomplete forcing axiom holds. Finally, we explore the relationships between bounded forcing axioms, preservation of Aronszajn trees of height and width $omeg{a}_1$ and generic absoluteness of $Sigm{a}_1^1$-statements over first order structures of size $omeg{a}_1$, also for other canonical classes of forcing.

Recommendations

• scientific article; zbMATH DE number 205700
• Ascending paths and forcings that specialize higher Aronszajn trees
• Can a small forcing create Kurepa trees
• Subcomplete forcing and \(\mathcal{L}\)-forcing
• Specializing Aronszajn Trees and Preserving Some Weak Diamonds

Cites work

• Bounded forcing axioms as principles of generic absoluteness
• Closed maximality principles: implications, separations and combinations
• Closure properties of parametric subcompleteness
• Degrees of rigidity for Souslin trees
• Hierarchies of (virtual) resurrection axioms
• Hierarchies of forcing axioms, the continuum hypothesis and square principles
• On Closed Sets of Ordinals
• Specializing Aronszajn Trees and Preserving Some Weak Diamonds
• Subcomplete forcing and \(\mathcal{L}\)-forcing
• The bounded proper forcing axiom
• Weak square and stationary reflection

Cited in

(12)

• The special tree number
• ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS
• The tree property at \(\omega_2\) and bounded forcing axioms
• Special subsets of the reals and tree forcing notions
• Subcomplete forcing principles and definable well-orders
• The subcompleteness of diagonal Prikry
• scientific article; zbMATH DE number 205700 (Why is no real title available?)
• Combining resurrection and maximality
• Forcing axioms via ground model interpretations
• Diagonal reflections on squares
• Closure properties of parametric subcompleteness
• Hierarchies of (virtual) resurrection axioms

This page was built for publication: Subcomplete forcing, trees, and generic absoluteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4692091)