Lesson plan

Iterated forcing

In the mathematical discipline of set theory, iterated forcing is a method for constructing models of set theory by repeating Cohen's forcing method a transfinite number of times. Iterated forcing was introduced by in their construction of a model of set theory with no Suslin tree. They also showed that iterated forcing can construct models where Martin's axiom holds and the continuum is any given regular cardinal. In iterated forcing, one has a transfinite sequence P α of forcing notions indexed by some ordinals α, which give a family of Boolean-valued models V P α . If α+1 is a successor ordinal then P α+1 is often constructed from P α using a forcing notion in V P α , while if α is a limit ordinal then P α is often constructed as some sort of limit (such as the direct limit) of the P β for β \omega_1 is not collapsed. This is often accomplished by the use of a preservation theorem such as: * Finite support iteration of c.c.c. forcings (see countable chain condition) are c.c.c. and thus preserve \omega_1 . * Countable support iterations of proper forcings are proper (see Fundamental Theorem of Proper Forcing) and thus preserve \omega_1 . * Revised countable support iterations of semi-proper forcings are semi-proper and thus preserve \omega_1 .…

Back to article

Article summary

In the mathematical discipline of set theory, iterated forcing is a method for constructing models of set theory by repeating Cohen's forcing method a transfinite number of times. Iterated forcing was introduced by in their construction of a model of set theory with no Suslin tree. They also showed that iterated forcing can construct models where Martin's axiom holds and the continuum is any given regular cardinal. In iterated forcing, one has a transfinite sequence P α of forcing notions indexed by some ordinals α, which give a family of Boolean-valued models V P α . If α+1 is a successor ordinal then P α+1 is often constructed from P α using a forcing notion in V P α , while if α is a limit ordinal then P α is often constructed as some sort of limit (such as the direct limit) of the P β for β \omega_1 is not collapsed. This is often accomplished by the use of a preservation theorem such as: * Finite support iteration of c.c.c. forcings (see countable chain condition) are c.c.c. and thus preserve \omega_1 . * Countable support iterations of proper forcings are proper (see Fundamental Theorem of Proper Forcing) and thus preserve \omega_1 . * Revised countable support iterations of semi-proper forcings are semi-proper and thus preserve \omega_1 .…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.