On Subcomplete Forcing

Abstract

I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to set theorists, while showing various properties of subcomplete forcing which one might desire of a forcing class, drawing comparisons between subcomplete forcing and countably closed forcing. In particular, I look at the interaction between subcomplete forcing and ${\omega }_1$-trees, preservation properties of subcomplete forcing, the subcomplete maximality principle, the subcomplete resurrection axiom, and show that generalized diagonal Prikry forcing is subcomplete.

arXiv commentThis is my PhD dissertation

Cited by in corpus (2)

• Aronszajn tree preservation and bounded forcing axioms
• Alternative Cichoń Diagrams and Forcing Axioms Compatible with CH