Switch to: Citations

Add references

You must login to add references.
  1. Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
  • The non-compactness of square.James Cummings, Matthew Foreman & Menachem Magidor - 2003 - Journal of Symbolic Logic 68 (2):637-643.
  • A Minimal Degree Which Collapses $omega_1$.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298-300.
    We consider a well-known partial order of Prikry for producing a collapsing function of minimal degree. Assuming $MA + \neq CH$, every new real constructs the collapsing map.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A minimal degree which collapses ω1.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298-300.
    We consider a well-known partial order of Prikry for producing a collapsing function of minimal degree. Assuming MA + ≠ CH, every new real constructs the collapsing map.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Minimal collapsing extensions of models of zfc.Lev Bukovský & Eva Copláková-Hartová - 1990 - Annals of Pure and Applied Logic 46 (3):265-298.
  • Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
    Uncountable superperfect forcing is tree forcing on regular uncountable cardinals κ with κ<κ=κ, using trees in which the heights of nodes that split along any branch in the tree form a club set, and such that any node in the tree with more than one immediate extension has measure-one-many extensions, where the measure is relative to some κ-complete, nonprincipal normal filter F. This forcing adds a generic of minimal degree if and only if F is κ-saturated.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations