Decisive creatures and large continuum
From MaRDI portal
Abstract: For let be the minimal number of uniform -splitting trees needed to cover the uniform -splitting tree, i.e. for every branch of the -tree, one of the -trees contains . is the dual notion: For every branch , one of the -trees guesses infinitely often. It is consistent that for many pairwise different cardinals and suitable pairs . For the proof we use creatures with sufficient bigness and halving. We show that the lim-inf creature forcing satisfies fusion and pure decision. We introduce decisiveness and use it to construct a variant of the countable support iteration of such forcings, which still satisfies fusion and pure decision.
Recommendations
Cites work
Cited in
(16)- Preservation of splitting families and cardinal characteristics of the continuum
- Many different uniformity numbers of Yorioka ideals
- On a cardinal invariant related to the Haar measure problem
- Specializing Aronszajn trees with strong axiom A and Halving
- Creature forcing and five cardinal characteristics in Cichoń's diagram
- Many different covering numbers of Yorioka's ideals
- Partition theorems from creatures and idempotent ultrafilters
- Polarized partitions on the second level of the projective hierarchy
- Monotone hulls for N M
- On cardinal characteristics of Yorioka ideals
- A friendly iteration forcing that the four cardinal characteristics of \mathcal E can be pairwise different
- Creature forcing and large continuum: the joy of halving
- Slalom numbers
- Abstract corrected iterations
- Covering a bounded set of functions by an increasing chain of slaloms
- Sheva-sheva-sheva: large creatures
This page was built for publication: Decisive creatures and large continuum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616344)