Simplified RCS iterations

Archive for Mathematical Logic 32 (5):341-349 (1993)
  Copy   BIBTEX

Abstract

We give a simplified treatment of revised countable support (RCS) forcing iterations, previously considered by Shelah (see [Sh, Chap. X]). In particular we prove the fundamental theorem of semi-proper forcing, which is due to Shelah: any RCS iteration of semi-proper posets is semi-proper

Categories

Keywords

Reprint years

DOI

10.1007/bf01409967

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: 103,090

External links

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

Through your library

My notes

Similar books and articles

Collapsing omega2omega _2 with semi-proper forcing.Stevo Todorcevic - 2018 - Archive for Mathematical Logic 57 (1-2):185-194.
New reals: Can live with them, can live without them.Martin Goldstern & Jakob Kellner - 2006 - Mathematical Logic Quarterly 52 (2):115-124.
Specialising Aronszajn trees by countable approximations.Heike Mildenberger & Saharon Shelah - 2003 - Archive for Mathematical Logic 42 (7):627-647.
Semi-proper forcing, remarkable cardinals, and Bounded Martin's Maximum.Ralf Schindler - 2004 - Mathematical Logic Quarterly 50 (6):527-532.
More about λ-support iterations of (<λ)-complete forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2013 - Archive for Mathematical Logic 52 (5-6):603-629.
On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
Hypergraphs and proper forcing.Jindřich Zapletal - 2019 - Journal of Mathematical Logic 19 (2):1950007.

Analytics

Added to PP
2013-11-23

Downloads
45 (#515,140)

6 months
9 (#327,343)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Shelah's work on non-semi-proper iterations, II.Chaz Schlindwein - 2001 - Journal of Symbolic Logic 66 (4):1865-1883.
On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.

Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Semiproper forcing axiom implies Martin maximum but not PFA+.Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):360-367.

Add more references