Switch to: Citations

Add references

You must login to add references.
  1. Combinatorics on ideals and forcing.Serge Grigorieff - 1971 - Annals of Mathematical Logic 3 (4):363.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   94 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  
  • Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Iterated perfectset forcing.J. E. Baumgartner - 1979 - Annals of Mathematical Logic 17 (3):271.
    Download  
     
    Export citation  
     
    Bookmark   30 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-439.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Variations on ◊.Keith J. Devlin - 1979 - Journal of Symbolic Logic 44 (1):51 - 58.
    Various equivalents and weakenings of the combinatorial principle $\diamond$ are considered. The paper contains both absolute results and consistency results. Also included is a new characterisation of the notion of a stationary subset of ω 1.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the Consistency of Borel's Conjecture.Richard Laver & James E. Baumgartner - 1983 - Journal of Symbolic Logic 48 (3):882-883.
    Download  
     
    Export citation  
     
    Bookmark   11 citations