Mathematics – Logic
Scientific paper
1996-05-10
Mathematics
Logic
Scientific paper
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=\{\alpha<\omega_2\colon\cf(\alpha)=\omega\}$ has an uncountable sequentially closed homogeneous subset, and existence of a precipitous normal filter on $\omega_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.
No associations
LandOfFree
Revised support iterations and CH does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Revised support iterations and CH, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revised support iterations and CH will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-521522