Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Combinatorial problems on trees: partitions, DELTA-systems and large free subtrees.M. Rubin - 1987 - Annals of Pure and Applied Logic 33 (1):43.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Game ideals.Pierre Matet - 2009 - Annals of Pure and Applied Logic 158 (1-2):23-39.
    We study a normal ideal on Pκ that is defined in terms of games.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Weak saturation of ideals on Pκ(λ).Pierre Matet - 2011 - Mathematical Logic Quarterly 57 (2):149-165.
    We show that if κ is an infinite successor cardinal, and λ > κ a cardinal of cofinality less than κ satisfying certain conditions, then no ideal on Pκ is weakly λ+-saturated. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-5d8df9484f-9zwsp uwo