Distributivity and Minimality in Perfect Tree Forcings for Singular Cardinals
Maxwell Levine, Heike Mildenberger

TL;DR
This paper investigates the distributivity and minimality properties of perfect tree forcings at singular cardinals, extending previous results to uncountable cofinalities and analyzing their implications for set-theoretic structures.
Contribution
It generalizes minimality results for perfect tree forcings without measurability assumptions and shows non-distributivity in cases of uncountable cofinality, addressing open questions.
Findings
P_ ext{ is minimal for -sequences without measurability assumptions.
P_ ext{ is not (,2)-distributive for uncountable cofinality .
P_ ext{ is not (, ext{}^+)-distributive under these assumptions.
Abstract
Dobrinen, Hathaway and Prikry studied a forcing consisting of perfect trees of height and width where is a singular -strong limit of cofinality . They showed that if is singular of countable cofinality, then is minimal for -sequences assuming that is a supremum of a sequence of measurable cardinals. We obtain this result without the measurability assumption. Prikry proved that is -distributive for all given a singular -strong limit cardinal of countable cofinality, and Dobrinen et al asked whether this result generalizes if has uncountable cofinality. We answer their question in the negative by showing that is not -distributive if is a -strong limit…
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
TopicsComputability, Logic, AI Algorithms · Computational Geometry and Mesh Generation · Advanced Topology and Set Theory
