Skip to main content

Happy Families and Their Relatives

  • Chapter
Book cover Combinatorial Set Theory

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

  • 2639 Accesses

Abstract

In this chapter we shall investigate combinatorial properties of certain families of infinite subsets of ω. In order to do so, we shall use many of the combinatorial tools developed in the preceding chapters. The families we investigate—particularly P-families and Ramsey families—will play a key role in understanding the combinatorial properties of Silver and Mathias forcing notions (see Chapter 22 and Chapter 24 respectively).

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

Access this chapter

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. Andreas Blass: The Rudin-Keisler ordering of p-points. Trans. Am. Math. Soc. 179, 145–166 (1973)

    MathSciNet  MATH  Google Scholar 

  3. David Booth: Ultrafilters on a countable set. Ann. Math. Log. 2, 1–24 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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 

  5. Jaime I. Ihoda: Unbounded filters on ω. In: Logic Colloquium ’87, Proceedings of the Colloquium held in Granada, Spain, July 20–25, 1987, J. Fernandez-Prida, M. Garrido, D. Lascar, M. Rodriguez Artalejo (eds.). Studies in Logic and the Foundations of Mathematics, vol. 129, pp. 105–115. North-Holland, Amsterdam (1989)

    Chapter  Google Scholar 

  6. Jussi A. Ketonen: On the existence of P-points in the Stone–Čech compactification of the integers. Fundam. Math. 92, 91–94 (1976)

    MathSciNet  MATH  Google Scholar 

  7. Claude Laflamme: Filter games and combinatorial properties of strategies. In: Set Theory, Tomek Bartoszyński, Marion Scheepers (eds.). Contemporary Mathematics, vol. 192, pp. 51–67. Am. Math. Soc., Providence (1996)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Adrian Richard David Mathias: 0# and the p-point problem. In: Higher Set Theory, Proceedings, Oberwolfach, Germany, April 13–23, 1977, Gert H. Müller, Dana S. Scott (eds.). Lecture Notes in Mathematics, vol. 669, pp. 375–384. Springer, Berlin (1978)

    Chapter  Google Scholar 

  10. Walter Rudin: Homogeneity problems in the theory of Čech compactifications. Duke Math. J. 23, 409–420 (1956)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  13. Jan van Mill: An introduction to βω. In: Handbook of Set-Theoretic Topology, K. Kunen, J.E. Vaughan (eds.), pp. 503–567. North-Holland, Amsterdam (1990)

    Google Scholar 

  14. Edward L. Wimmers: The Shelah P-point independence theorem. Isr. J. Math. 43, 28–48 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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). Happy Families and Their Relatives. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-4471-2173-2_10

Download citation

Publish with us

Policies and ethics