A Side Condition Principle With Applications
Hannes Jakob, John Krueger
Abstract
We introduce a combinatorial principle SC(κ), for any regular cardinal κ ω2, which asserts the existence of a family Y ⊂eq [H(κ)]ω of elementary substructures of H(κ) which is closed under finite intersections and satisfies that for stationarily many N ∈ Y, if M ∈ Y and M ω1 < N ω1, then M N κ∈ N. We explore the idea of defining forcings with side conditions consisting of finite subsets of such a family Y. If SC(ω2) holds, then there exists a thin stationary subset of [ω2]ω, and consequently SC(ω2) is independent of ZFC. Assuming that μ is a Mahlo cardinal, the Lévy collapse Col(ω,<μ) forces that SC(κ) holds for all regular cardinals κ ω2. Local instances of SC can be forced using matrices of models or derived as consequences of square principles. We apply the principle SC to define two kinds of forcings: a streamlined version of a strongly proper collapse, and a forcing which is strongly proper on a stationary set and adds arbitrarily many Baumgartner clubs. Finally, we prove two consistency results using forcings derived from SC related to Aronszajn trees, the guessing model principle, strong failures of club guessing, and the higher dominating number.
Create a lesson
Related papers
Iterating logarithms and well-foundedness
Gervasio Figueroa, Joel Kuperman, Pedro Sánchez Terraf
Friedman--Stanley cofinality without Borel completeness
Ruijun Wang
On Farah ideals and beyond
Adam Kwela
The 1-2-3 Conjecture for Borel Combinatorics
Junhao Chen, Wei Dai
No Borel upper bound for the Fσ equivalence relations
Ruijun Wang
Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective
Olivia Aubone, Eduardo Dueñez, José Iovino