Rado's Conjecture implies that all stationary set preserving forcings are semiproper

Journal of Mathematical Logic 13 (1):1350001 (2013)
  Copy   BIBTEX

Abstract

Todorčević showed that Rado's Conjecture implies CC*, a strengthening of Chang's Conjecture. We generalize this by showing that also CC**, a global version of CC*, follows from RC. As a corollary we obtain that RC implies Semistationary Reflection and, i.e. the statement that all forcings that preserve the stationarity of subsets of ω1 are semiproper.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,131

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-17

Downloads
36 (#698,044)

6 months
8 (#527,284)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Combinatorial dichotomies in set theory.Stevo Todorcevic - 2011 - Bulletin of Symbolic Logic 17 (1):1-72.
Rado’s Conjecture and its Baire version.Jing Zhang - 2019 - Journal of Mathematical Logic 20 (1):1950015.

Add more citations

References found in this work

PFA Implies ADL(R).John Steel - 2005 - Journal of Symbolic Logic 70 (4):1255 - 1296.
Semistationary and stationary reflection.Hiroshi Sakai - 2008 - Journal of Symbolic Logic 73 (1):181-192.

Add more references