arXiv subjects
Publications and source records attributed to Chaz Schlindwein.
This is an exposition of the first two sections of Chapter VI of Shelah's book Proper and Improper Forcing. It covers various preservation theorems for CS iteration of proper forcing (omega-omega bounding, Sacks property, P-point property, etc.)
This is an exposition of much of Sections VI.3 and XVIII.3 of "Proper and Improper Forcing", including preservations for "no random reals over V", "reals of V form a non-meager set", "every dense open set contains a dense open set in V", weak bounding, and weak $ω^ω$-bounding. The current version of part I covering Sections VI.1 and VI.2 is available from the author.
This expository paper covers the first two sections of chapter VI of Shelah's book "Proper and Improper Forcing," including the preservationn (using CS iterations of proper forcings) of omega-omega bounding, Sacks property, Lavewr property, P-point property, and others.
This is an expository paper for Chapter 6 of Proper and Improper Forcing. Now includes an exposition of Shelah's proof of preservation of Sacks property as well as omega-omega bounding.
The following is consistent: There is a stationary set S such that every Aronszajn tree is S-*-special and there is an Aronszajn tree T such that for every unbounded E we have T is not E-special. This answers a question of Shelah (Proper and Improper Forcing, IX.4.9(5).
We prove that any countable support iteration formed with posets with $ω_2$-p.i.c.\ has $ω_2$-c.c., assuming CH in the ground model and assuming also that $ω_1$ is not collapsed. This improves earlier results of Shelah by removing the restriction on the length of the iteration. Thus, we solve the problem of obtaining a large continuum via such forcing iterations.
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
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible sequences all of whose proper initial segments are constructible, Friedman's problem on whether every 2-coloring of $S^2_0=\{α<ω_2\colon\cf(α)=ω\}$ has an uncountable sequentially closed homogeneous subset, and existence of a precipitous normal filter on $ω_2$ with $S^2_0\in{\cal F}$. The posets which Shelah uses in these constructions are Prikry forcing, Namba forcing, and the forcing consisting of closed countable subsets of $S^*$ under reverse end-extension, where $S^*$ is a fixed stationary co-stationary subset of $S^2_0$. Shelah establishes different preservation theorems for each of these three posets (the theorem for Namba forcing is particularly intricate). We establish a general preservation theorem for a variant of RCS iterations which includes all three posets in a straightforward way.