Abstract
For f, g $ \in \omega ^\omega $ let $c_{f,g}^\forall $ be the minimal number of uniform g-splitting trees (or: Slaloms) to cover the uniform f-splitting tree, i.e., for every branch v of the f-tree, one of the g-trees contains v. $c_{f,g}^\exists $ is the dual notion: For every branch v, one of the g-trees guesses v(m) infinitely often. It is consistent that $c_{f \in ,g \in }^\exists = c_{f \in ,g \in }^\forall = k_ \in $ for N₁ many pairwise different cardinals $k_ \in $ and suitable pairs $(f_{ \in ,g \in } ).$ 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