Skip to main content
SpringerLink
Log in

Mathias Forcing

  • Chapter
Combinatorial Set Theory

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

  • 2725 Accesses

Abstract

In this chapter we investigate a forcing notion which is closely related to Ramsey’s Theorem 2.1 and to Ramsey ultrafilters (defined in Chapter 10). So, it is not surprising that also Ramsey families (also defined in Chapter 10) are involved.

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, Haim Judah: Set Theory: On the Structure of the Real Line. AK Peters, Wellesley (1995)

    MATH  Google Scholar 

  2. Jörg Brendle: Combinatorial properties of classical forcing notions. Ann. Pure Appl. Log. 73, 143–170 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Michael Canjar: Mathias forcing which does not add dominating reals. Proc. Am. Math. Soc. 104, 1239–1248 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Erik Ellentuck: A new proof that analytic sets are Ramsey. J. Symb. Log. 39, 163–165 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lorenz Halbeisen: A playful approach to Silver and Mathias forcings. In: Foundations of the Formal Sciences V: Infinite Games, Stefan Bold, Benedikt Löwe, Thoralf Räsch, Johan van Benthem (eds.). Papers of a Conference held in Bonn, November 26–29, 2004. Studies in Logic, vol. 11, pp. 123–142. College Publications, London (2007)

    Google Scholar 

  6. Lorenz Halbeisen, Haim Judah: Mathias absoluteness and the Ramsey property. J. Symb. Log. 61, 177–193 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Haim Judah: Exact equiconsistency results for \(\varDelta ^{1}_{3}\) -sets of reals. Arch. Math. Log. 32, 101–112 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Haim Judah, Saharon Shelah: \(\varDelta ^{1}_{2}\) -sets of reals. Ann. Pure Appl. Log. 42, 207–223 (1989)

    Article  MathSciNet  Google Scholar 

  9. Haim Judah, Saharon Shelah: Forcing minimal degree of constructibility. J. Symb. Log. 56, 769–782 (1991)

    MathSciNet  MATH  Google Scholar 

  10. Haim Judah, Saharon Shelah, W. Hugh Woodin: The Borel conjecture. Ann. Pure Appl. Log. 50, 255–269 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Adrian Richard David Mathias: Happy families. Ann. Math. Log. 12, 59–111 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Saharon Shelah: Can you take Solovay’s inaccessible away? Isr. J. Math. 48, 1–47 (1984)

    Article  MATH  Google Scholar 

  13. Jack Silver: Every analytic set is Ramsey. J. Symb. Log. 35, 60–64 (1970)

    Article  MathSciNet  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). Mathias Forcing. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-4471-2173-2_24

Download citation

Publish with us

Policies and ethics

Search

Navigation