Skip to main content
SpringerLink
Log in

Properties of Forcing Extensions

  • Chapter
Combinatorial Set Theory

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 2627 Accesses

Abstract

In this chapter we shall introduce some combinatorial properties of forcing notions which will accompany us throughout the remainder of this book. Furthermore, these properties will be the main tool in order to investigate various combinatorial properties of generic models of ZFC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tomek Bartoszyński, Martin Goldstern, Haim Judah, Saharon Shelah: All meager filters may be null. Proc. Am. Math. Soc. 117, 515–521 (1993)

    MATH  Google Scholar 

  2. Tomek Bartoszyński, Haim Judah: Set Theory: On the Structure of the Real Line. AK Peters, Wellesley (1995)

    MATH  Google Scholar 

  3. James E. Baumgartner: Iterated forcing. In: Surveys in Set Theory, A.R.D. Mathias (ed.). London Mathematical Society Lecture Note Series, vol. 87, pp. 1–59. Cambridge University Press, Cambridge (1983)

    Chapter  Google Scholar 

  4. James E. Baumgartner: Applications of the proper forcing axiom. In: Handbook of Set - Theoretic Topology, K. Kunen, J.E. Vaughan (eds.), pp. 913–959. North-Holland, Amsterdam (1990)

    Google Scholar 

  5. Andreas Blass, Saharon Shelah: There may be simple \(P_{\aleph_{1}}\) - and \(P_{\aleph_{2}}\) -points and the Rudin–Keisler ordering may be downward directed. Ann. Pure Appl. Log. 33, 213–243 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Martin Goldstern: Tools for your forcing construction. In: Set Theory of the Reals, H. Judah (ed.). Israel Mathematical Conference Proceedings, pp. 305–360. Bar-Ilan University, Israel (1993)

    Google Scholar 

  7. Thomas Jech: Multiple Forcing. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1986)

    MATH  Google Scholar 

  8. Saharon Shelah: Proper Forcing. Lecture Notes in Mathematics, vol. 940. Springer, Berlin (1982)

    Book  MATH  Google Scholar 

  9. Saharon Shelah: Proper and Improper Forcing. Perspectives in Mathematical Logic. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Zürich, Zürich, Switzerland

    Lorenz J. Halbeisen

Authors
  1. Lorenz J. Halbeisen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lorenz J. Halbeisen .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Halbeisen, L.J. (2012). Properties of Forcing Extensions. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-4471-2173-2_20

Download citation

Publish with us

Policies and ethics

Search

Navigation