Indestructibility of some compactness principles over models of PFA
Abstract
We show that PFA (Proper Forcing Axiom) implies that adding any number of Cohen subsets of ω will not add an ω2-Aronszajn tree or a weak ω1-Kurepa tree, and moreover no σ-centered forcing can add a weak ω1-Kurepa tree (a tree of height and size ω1 with at least ω2 cofinal branches). This partially answers an open problem whether ccc forcings can add ω2-Aronszajn or ω1-Kurepa trees. We actually prove more: We show that a consequence of PFA, namely the guessing model principle, GMP, which is equivalent to the ineffable slender tree property, ISP, is preserved by adding any number of Cohen subsets of ω. And moreover, GMP implies that no σ-centered forcing can add a weak ω1-Kurepa tree. For more generality, we study the principle GMP at an arbitrary regular cardinal = < (we denote this principle GMP++), and as an application we show that there is a model in which there are no weak ω+1-Kurepa trees and no ω+2-Aronszajn trees.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.