Switch to: Citations

References in:

Splittings

Archive for Mathematical Logic 35 (4):263-277 (1996)

Add references

You must login to add references.
  1. Set Theory: An Introduction to Independence Proofs.Kenneth Kunen - 1980 - North-Holland.
    Download  
     
    Export citation  
     
    Bookmark   169 citations  
  • (2 other versions)Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • Partitions and filters.P. Matet - 1986 - Journal of Symbolic Logic 51 (1):12-21.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Adjoining dominating functions.James E. Baumgartner & Peter Dordal - 1985 - Journal of Symbolic Logic 50 (1):94-101.
    If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every well-ordered unbounded family of increasing functions is a scale, and the splitting number s (and hence the distributivity number h) remains at ω 1.
    Download  
     
    Export citation  
     
    Bookmark   21 citations