Selective Independence and h-Perfect Tree Forcing Notions

From MaRDI portal
Selective Independence and $h$-Perfect Tree Forcing Notions




Abstract: Generalizing the proof for Sacks forcing, we show that the h-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the consistency of mathfraki=mathfraku<mathrmnon(mathcalN)=mathrmcof(mathcalN) and mathfraki<mathfraku=mathrmnon(mathcalN)=mathrmcof(mathcalN) as well as some related results.














This page was built for publication: Selective Independence and $h$-Perfect Tree Forcing Notions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392040)