Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T05:32:10.706Z Has data issue: false hasContentIssue false

Decisive creatures and large continuum

Published online by Cambridge University Press:  12 March 2014

Jakob Kellner
Affiliation:
Kurt Gödel Research Center for Mathematical Logic, Universität Wien, Währinger Straße 25, 1090 Wien, Austria, E-mail: kellner@fsmat.at, URL: http://www.logic.univie.ac.at/~kellner
Saharon Shelah
Affiliation:
Einstein Institute of Mathematics, Edmond J. Safra Campus, Givat Ram, The Hebrew University of Jerusalem, Jerusalem, 91904, IsraelDepartment of Mathematics, Rutgers University, New Brunswick, Nj 08854, USA, E-mail: shelah@math.huji.ac.il, URL: http://shelah.logic.at

Abstract

For f, g ∈ ωω let 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. is the dual notion: For every branch v, one of the g-trees guesses v(m) infinitely often.

It is consistent that for ℵ1 many pairwise different cardinals κ∊ and suitable pairs (f∊, g∊).

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable