paper

Subcomplete forcing, trees and generic absoluteness

arXiv:1708.08170

Abstract

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

Some results were added and some arguments streamlined