Abstract
Abstract. We throw some light on the question: is there a MAD family (a maximal family of infinite subsets of N, the intersection of any two is finite) that is saturated (=completely separable i.e., any X U N is included in a finite union of members of the family or includes a member (and even continuum many members) of the family). We prove that it is hard to prove the consistency of the negation: (i)if mathamatical equation repersented then there is such a family; (ii)if there is no such family, then some situation related to pcf holds whose consistency is large (and if a* > N1 even unknown);(iii) if, e.g., there is no inner model with measurables, then there is such a family.
| Original language | English |
|---|---|
| Pages (from-to) | 1416-1435 |
| Number of pages | 20 |
| Journal | Canadian Journal of Mathematics |
| Volume | 63 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2011 |
Keywords
- MAD families
- Pcf
- The continuum
Fingerprint
Dive into the research topics of 'MAD saturated families and SANE Player'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver