The CUNY Graduate Center
Subcomplete forcings are a class of forcings introduced by Jensen. These forcings do not add reals but may change cofinalities to $\omega$, unlike proper forcings. Examples of subcomplete forcings include Namba forcing, Prikry forcing, and any countably closed forcing. In this talk I will discuss some results concerning subcomplete forcing and the preservation of various properties of trees.
Kaethe Minden is currently a graduate student in the Ph.D. program in mathematics at the CUNY Graduate Center, studying set theory under the supervision of Gunter Fuchs.