More on forcing iteration
Logic
2009-09-25 v1
Abstract
The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the countable support versions. Example: The countable support iteration of Namba forcing over a ground model of CH does not add reals. Example: A countable support iteration built from Namba forcing and Cohen forcing, over a ground model of CH, does not collapse omega_1
Keywords
Cite
@article{arxiv.math/9612208,
title = {More on forcing iteration},
author = {Chaz Schlindwein},
journal= {arXiv preprint arXiv:math/9612208},
year = {2009}
}