Switch to: References

Add citations

You must login to add citations.
  1. Adjoining Almost Disjoint Permutations.Yi Zhang - 2002 - Mathematical Logic Quarterly 48 (2):189-193.
    We show that it is consistent with ZFC + ¬CH that there is a maxima a most disjoint permutation family A ⊆ Symsuch that A is a proper subset of an eventually different family E ⊆ ℕℕ and |A| < |E|. We also ask severa questions in this area.
    Download  
     
    Export citation  
     
    Bookmark  
  • Forcing indestructibility of MAD families.Jörg Brendle & Shunsuke Yatabe - 2005 - Annals of Pure and Applied Logic 132 (2):271-312.
    Let A[ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families which are P-indestructible yet Q-destructible for several pairs of forcing notions . We close with a detailed investigation of iterated Sacks indestructibility.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Almost disjoint families and diagonalizations of length continuum.Dilip Raghavan - 2010 - Bulletin of Symbolic Logic 16 (2):240 - 260.
    We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly constructions of almost disjoint families of various sorts. We emphasize the role of cardinal invariants of the continuum and their combinatorial characterizations in such constructions.
    Download  
     
    Export citation  
     
    Bookmark