Mad Families Constructed from Perfect Almost Disjoint Families
Authors:
- Jörg BrendleJBJörg Brendle
- Yurii KhomskiiYKYurii Khomskii
- 1 December 2013
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 78 (4) , 1164-1180
Abstract
We prove the consistency of together with the existence of a -definable mad family, answering a question posed by Friedman and Zdomskyy in [7, Question 16]. For the proof we construct a mad family in L which is an ℵ1-union of perfect a.d. sets, such that this union remains mad in the iterated Hechler extension. The construction also leads us to isolate a new cardinal invariant, the Borel almost-disjointness number, defined as the least number of Borel a.d. sets whose union is a mad family. Our proof yields the consistency of (and hence, ).Keywords
This publication has 6 references indexed in Scilit:
- Comparing the closed almost disjointness and dominating numbersFundamenta Mathematicae, 2012
- Projective wellorders and mad families with large continuumAnnals of Pure and Applied Logic, 2011
- Projective mad familiesAnnals of Pure and Applied Logic, 2010
- Maximal almost disjoint families of functionsFundamenta Mathematicae, 2009
- Forcing indestructibility of MAD familiesAnnals of Pure and Applied Logic, 2005
- Infinite combinatorics and definabilityAnnals of Pure and Applied Logic, 1989