Abstract
There is a partial order \({\mathbb{P}}\) preserving stationary subsets of ω 1 and forcing that every partial order in the ground model V that collapses a sufficiently large ordinal to ω 1 over V also collapses ω 1 over \({V^{\mathbb{P}}}\) . The proof of this uses a coding of reals into ordinals by proper forcing discovered by Justin Moore and a symmetric extension of the universe in which the Axiom of Choice fails. Also, using one feature of the proof of the above result together with an argument involving the stationary tower it is shown that sometimes, after adding one Cohen real c, there are, for every real a in V[c], sets A and B such that c is Cohen generic over both L[A] and L[B] but a is constructible from A together with B.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Feng Q., Jech T.: Projective stationary sets and a strong reflection principle. J. Lond. Math. Soc. 58(3), 271–283 (1998)
Foreman M., Magidor M.: Large cardinals and definable counterexamples to the continuum hypothesis. Ann. Pure Appl. Logic 76, 47–97 (1995)
Foreman M., Magidor M., Shelah S.: Martin’s maximum, saturated ideals, and non-regular ultrafilters. Part I. Ann. Math. 127, 1–47 (1988)
Jech T.: The Axiom of Choice. North-Holland, Amsterdam (1973)
Jech T.: Set Theory The Third Millenium Edition. Springer, Berlin (2003)
Larson, P.: The stationary tower. Notes on a course. In: Woodin, W.H. (ed.) University Lecture Series, 32. American Mathematical Society, Providence (2004)
Moore, J.: Set mapping reflection, J. Math. Logic 5 (2005), no. 1, 87–97. With a correction: Erratum: “Set mapping reflection”, J. Math. Logic 5(2):299
Veličković B.: Forcing axioms and stationary sets. Adv. Math. 94, 256–284 (1992)
Woodin, H.: The Axiom of Determinacy Forcing Axioms and the Nonstationary Ideal, De Gruyter Series in Logic and its Applications, Number 1. Berlin, New York (1999)