@article{SaharonShelah2010,
abstract = {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.},
author = {Saharon Shelah},
journal = {Open Mathematics},
keywords = {Iterated forcing; Countable chain condition; Large continuum; Peculiar cuts; large continuum; oracle cc; iterated forcing; countable chain condition; peculiar cuts},
language = {eng},
number = {2},
pages = {213-234},
title = {Large continuum, oracles},
url = {http://eudml.org/doc/269631},
volume = {8},
year = {2010},
}
TY - JOUR
AU - Saharon Shelah
TI - Large continuum, oracles
JO - Open Mathematics
PY - 2010
VL - 8
IS - 2
SP - 213
EP - 234
AB - 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.
LA - eng
KW - Iterated forcing; Countable chain condition; Large continuum; Peculiar cuts; large continuum; oracle cc; iterated forcing; countable chain condition; peculiar cuts
UR - http://eudml.org/doc/269631
ER -
