Decisive creatures and large continuum

From MaRDI portal



Abstract: For f,ginomegaho let mycfaf,g be the minimal number of uniform g-splitting trees needed to cover the uniform f-splitting tree, i.e. for every branch u of the f-tree, one of the g-trees contains u. mycf,g is the dual notion: For every branch u, one of the g-trees guesses u(m) infinitely often. It is consistent that mycfepsilon,gepsilon=mycfafepsilon,gepsilon=kappaepsilon for al1 many pairwise different cardinals kappaepsilon and suitable pairs (fepsilon,gepsilon). 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.











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)