MAD Families and SANE Player

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We throw some light on the question: is there a MAD family (= a family of infinite subsets of N, the intersection of any two is finite) which is completely separable (i.e. any X subseteq N is included in a finite union of members of the family or include a member of the family). We prove that it is hard to prove the consistency of the negation: (a) if 2^{aleph_0} < aleph_omega, then there is such a family (b) if there is no such families then some situation related to pcf holds whose consistency is large.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

MAD Families and SANE Player does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MAD Families and SANE Player, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MAD Families and SANE Player will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-132593

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.