Forcing axioms via ground model interpretations
Abstract
We study principles of the form: if a name σ is forced to have a certain property , then there is a ground model filter g such that σg satisfies . We prove a general correspondence connecting these name principles to forcing axioms. Special cases of the main theorem are: Any forcing axiom can be expressed as a name principle. For instance, PFA is equivalent to a principle for rank 1 names (equivalently, nice names) for subsets of ω1, and a principle for rank 2 names for sets of reals. Moreover, λ-bounded forcing axioms are equivalent to name principles. Bagaria's characterisation of BFA via generic absoluteness is a corollary. We further systematically study name principles where is a notion of largeness for subsets of ω1 (such as being unbounded, stationary or in the club filter) and corresponding forcing axioms.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.