Author:
Levine Maxwell,Mildenberger Heike
Abstract
AbstractDobrinen, 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 (λ, 2)-distributive if κ is a λ-strong limit of uncountable cofinality λ and we obtain the same result for a range of similar forcings, including one that Dobrinen et al. consider that consists of pre-perfect trees. We also show that ℙκ in particular is not (ω, ·, λ+)-distributive under these assumptions.While developing these ideas, we address natural questions regarding minimality and collapses of cardinals.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. B. Balcar and P. Simon, On collections of almost disjoint families, Commentationes Mathematicae Universitatis Carolinae 29 (1988), 631–646.
2. B. Balcar and P. Simon, Disjoint refinement, in Handbook of Boolean Algebras, Vol. 2, North-Holland, Amsterdam, 1989, pp. 333–388.
3. J. E. Baumgartner, Almost-disjoint sets, the dense set problem and the partition calculus, Annals of Mathematical Logic 9 (1976), 401–439.
4. J. Brendle, A. Brooke-Taylor, S.-D. Friedman and D. C. Montoya, Cichoń’s diagram for uncountable cardinals, Israel Journal of Mathematics 225 (2018), 959–1010.
5. E. T. Brown and M. J. Groszek, Uncountable superperfect forcing and minimality, Annals of Pure and Applied Logic 144 (2006), 73–82.