# Blog Archives

# Topic Archive: subcomplete forcing

Set theory seminarFriday, February 19, 201610:00 amGC 6417

# Why is Prikry forcing subcomplete?

The CUNY Graduate Center

Subcomplete forcing was introduced by Jensen as a class of forcings which do not add reals, but may change cofinalities to $\omega$, unlike proper forcing. In this talk I will show that Prikry forcing is subcomplete.

Set theory seminarFriday, November 20, 201510:00 amGC 3212

# Subcomplete forcings

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.