More on forcing iteration

Details More on forcing iteration More on forcing iteration

1996-12-26

arxiv.org/abs/math/9612208v1

Mathematics

Logic

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

More on forcing iteration 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 More on forcing iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More on forcing iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641541