Specializing Trees with Small Approximations I
Rahman Mohammadpour

TL;DR
Under the assumption of PFA, the paper introduces a forcing method that specializes certain trees of height ω₂ without cofinal branches, preserving cardinalities and possessing the ω₁-approximation property.
Contribution
It develops a new forcing technique using internally club ω₁-guessing models to specialize trees of height ω₂ under PFA, with finite conditions and preservation properties.
Findings
For every tree of height ω₂ without cofinal branches, a proper, ω₂-preserving forcing specializes it.
The forcing has the ω₁-approximation property, ensuring certain structural preservation.
The method relies on side conditions involving club models under PFA.
Abstract
Assuming , we shall use internally club -guessing models as side conditions to show that for every tree of height without cofinal branches, there is a proper and -preserving forcing notion with finite conditions which specialises . Moreover, the forcing has the -approximation property.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Complexity and Algorithms in Graphs
