Mob families and mad families

Archive for Mathematical Logic 37 (3):183-197 (1998)
  Copy   BIBTEX

Abstract

We show the consistency of ${\frak o} <{\frak d}$ where ${\frak o}$ is the size of the smallest off-branch family, and ${\frak d}$ is as usual the dominating number. We also prove the consistency of ${\frak b} < {\frak a}$ with large continuum. Here, ${\frak b}$ is the unbounding number, and ${\frak a}$ is the almost disjointness number

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-23

Downloads
28 (#588,332)

6 months
4 (#863,607)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Mad families, splitting families and large continuum.Jörg Brendle & Vera Fischer - 2011 - Journal of Symbolic Logic 76 (1):198 - 208.
Forcing indestructibility of MAD families.Jörg Brendle & Shunsuke Yatabe - 2005 - Annals of Pure and Applied Logic 132 (2):271-312.
Bounding, splitting, and almost disjointness.Jörg Brendle & Dilip Raghavan - 2014 - Annals of Pure and Applied Logic 165 (2):631-651.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references