📑 Table of Contents

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 Solovay and Tennenbaum (1971) 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 VPα. If α+1 is a successor ordinal then Pα+1 is often constructed from Pα using a forcing notion in VPα, 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 β<α.

A key consideration is that, typically, it is necessary that 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 .
  • Countable support iterations of proper forcings are proper (see Fundamental Theorem of Proper Forcing) and thus preserve .
  • Revised countable support iterations of semi-proper forcings are semi-proper and thus preserve .

Some non-semi-proper forcings, such as Namba forcing, can be iterated with appropriate cardinal collapses while preserving using methods developed by Saharon Shelah.[1][2][3]

References

edit
  1. ^ Shelah, S., Proper and Improper Forcing, Springer 1992
  2. ^ Schlindwein, Chaz, Shelah's work on non-semiproper iterations I, Archive for Mathematical Logic (47) 2008 pp. 579–606
  3. ^ Schlindwein, Chaz, Shelah's work on non-semiproper iterations II, Journal of Symbolic Logic (66) 2001, pp. 1865–1883

Sources

edit
  • Jech, Thomas (2003), Set Theory: Millennium Edition, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7
  • Kunen, Kenneth (1980), Set Theory: An Introduction to Independence Proofs, Elsevier, ISBN 978-0-444-86839-8
  • Shelah, Saharon (1998) [1982], Proper and improper forcing, Perspectives in Mathematical Logic (2 ed.), Berlin: Springer-Verlag, ISBN 3-540-51700-6, MR 1623206
  • Solovay, R. M.; Tennenbaum, S. (1971). "Iterated Cohen extensions and Souslin's problem". Ann. of Math. 2. 94 (2): 201–245. doi:10.2307/1970860. JSTOR 1970860.
edit

📚 Artikel Terkait di Wikipedia

List of forcing notions

introduced another type of iterated forcing to determine the possible values of the continuum function at regular cardinals. Iterated forcing with countable support

Iteration

of statements is said to be iterated. A computer programmer might also refer to that block of statements as an iteration. Loops constitute the most common

Prisoner's dilemma

multi-player iterated version of the game. In 1975, Grofman and Pool estimated the count of scholarly articles devoted to it at over 2,000. The iterated prisoner's

Robert M. Solovay

stationary sets; With Stanley Tennenbaum, developing the method of iterated forcing and showing the consistency of Suslin's hypothesis; With Donald A.

Silver cardinal

Silver in some multiply-iterated forcing extension of V (without added ordinals below existing ordinals). What prevents us from forcing another weakly Silver

Saharon Shelah

In set theory, he discovered the notion of proper forcing, an important tool in iterated forcing arguments. With PCF theory, he showed that in spite

Jack Silver

Silver at the Mathematics Genealogy Project Cummings, James (2009). "Iterated Forcing and Elementary Embeddings". In Handbook of Set Theory, Springer, pp

James Earl Baumgartner

filters, ideals, and partition relations, iterated forcing and Axiom A, proper forcing and the proper forcing axiom, chromatic number of graphs, a thin