Switch to: Citations

Add references

You must login to add references.
  1. Squares, scales and stationary reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (01):35-98.
    Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...)
    Download  
     
    Export citation  
     
    Bookmark   103 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  
  • Scales, squares and reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (1):35-98.
    Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...)
    Download  
     
    Export citation  
     
    Bookmark   65 citations  
  • Approachability and games on posets.Yasuo Yoshinobu - 2003 - Journal of Symbolic Logic 68 (2):589-606.
    We show that for any infinite cardinal κ, every strongly $(\kappa + 1)-strategically$ closed poset is strongly $\kappa^+-strategically$ closed if and only if $AP_\kappa$ (the approachability property) holds, answering the question asked in [5]. We also give a complete classification of strengths of strategic closure properties and that of strong strategic closure properties respectively.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Semiproper forcing axiom implies Martin maximum but not PFA+.Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):360-367.
    We prove that MM (Martin maximum) is equivalent (in ZFC) to the older axiom SPFA (semiproper forcing axiom). We also prove that SPFA does not imply SPFA + or even PFA + (using the consistency of a large cardinal).
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Separating stationary reflection principles.Paul Larson - 2000 - Journal of Symbolic Logic 65 (1):247-258.
    We present a variety of (ω 1 ,∞)-distributive forcings which when applied to models of Martin's Maximum separate certain well known reflection principles. In particular, we do this for the reflection principles SR, SR α (α ≤ ω 1 ), and SRP.
    Download  
     
    Export citation  
     
    Bookmark   13 citations