Decisive creatures and large continuum

Details Decisive creatures and large continuum Decisive creatures and large continuum

2006-01-04

arxiv.org/abs/math/0601083v2

J. Symbolic Logic 74 (2009), No. 1, 73--104

Mathematics

Logic

major revision

Scientific paper

10.2178/jsl/1231082303

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is the dual notion: For every branch $\nu$, one of the $g$-trees guesses $\nu(m)$ infinitely often. It is consistent that $\myc_{f_\epsilon,g_\epsilon}=\mycfa_{f_\epsilon,g_\epsilon}=\kappa_\epsilon$ for $\al1$ many pairwise different cardinals $\kappa_\epsilon$ and suitable pairs $(f_\epsilon,g_\epsilon)$. 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.

Affiliated with

Also associated with

No associations

Rating

Decisive creatures and large continuum does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decisive creatures and large continuum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decisive creatures and large continuum will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591247