English

Subcomplete forcing, trees and generic absoluteness

Logic 2018-02-06 v2

Abstract

We investigate properties of trees of height ω1\omega_1 and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an ω1\omega_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 ω1\omega_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 ω1\omega_1 and generic absoluteness of Σ11\Sigma^1_1-statements over first order structures of size ω1\omega_1, also for other canonical classes of forcing.

Keywords

Cite

@article{arxiv.1708.08170,
  title  = {Subcomplete forcing, trees and generic absoluteness},
  author = {Gunter Fuchs and Kaethe Minden},
  journal= {arXiv preprint arXiv:1708.08170},
  year   = {2018}
}

Comments

Some results were added and some arguments streamlined

R2 v1 2026-06-22T21:24:47.079Z