Our main theorem is about iterated forcing for making the continuum larger than ℵ2. We present a generalization of [2] which deal with oracles for random, (also for other cases and generalities), by replacing ℵ1,ℵ2 by λ, λ + (starting with λ = λ <λ > ℵ1). Well, we demand absolute c.c.c. So we get, e.g. the continuum is λ + but we can get cov(meagre) = λ and we give some applications. As in non-Cohen oracles [2], it is a “partial” countable support iteration but it is c.c.c.
Contents
-
Open AccessLarge continuum, oraclesApril 14, 2010
-
April 14, 2010
-
April 14, 2010
-
April 14, 2010
-
Open AccessOn locally finite minimal non-solvable groupsApril 14, 2010
-
Open AccessSeparable K-linear categoriesApril 14, 2010
-
April 14, 2010
-
Open AccessOn the singularities of multiple L-functionsApril 14, 2010
-
April 14, 2010
-
Open AccessContinuous tree-like scalesApril 14, 2010
-
Open AccessAltitude of wheels and wheel-like graphsApril 14, 2010
-
Open AccessStable bundles on hypercomplex surfacesApril 14, 2010
-
April 14, 2010
-
April 14, 2010
-
April 14, 2010
-
Open AccessMultivalued fractals in b-metric spacesApril 14, 2010
-
April 14, 2010
-
Open AccessOn q-Szász-Durrmeyer operatorsApril 14, 2010