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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Shelah’s work on non-semi-proper iterations, I.Chaz Schlindwein - 2008 - Archive for Mathematical Logic 47 (6):579-606.
Shelah's work on non-semi-proper iterations, II.Chaz Schlindwein - 2001 - Journal of Symbolic Logic 66 (4):1865-1883.
More about λ-support iterations of (<λ)-complete forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2013 - Archive for Mathematical Logic 52 (5-6):603-629.
Specialising Aronszajn trees by countable approximations.Heike Mildenberger & Saharon Shelah - 2003 - Archive for Mathematical Logic 42 (7):627-647.
Preserving Preservation.Jakob Kellner & Saharon Shelah - 2005 - Journal of Symbolic Logic 70 (3):914 - 945.
Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
Strongly unfoldable cardinals made indestructible.Thomas A. Johnstone - 2008 - Journal of Symbolic Logic 73 (4):1215-1248.
Preserving Non-null with Suslin+ Forcings.Jakob Kellner - 2006 - Archive for Mathematical Logic 45 (6):649-664.
Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.
Compact set valued flows: Applications in biological modelling.Jacques Demongeot, Paul Kulesal & James Muffay - 1996 - Acta Biotheoretica 44 (3-4):349-358.
Iterations of Boolean algebras with measure.Anastasis Kamburelis - 1989 - Archive for Mathematical Logic 29 (1):21-28.
Matrix iterations and Cichon’s diagram.Diego Alejandro Mejía - 2013 - Archive for Mathematical Logic 52 (3-4):261-278.

Analytics

Added to PP
2013-11-23

Downloads
27 (#572,408)

6 months
2 (#1,263,261)

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