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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   102 citations  
  • The weak □* is really weaker than the full □.Shai Ben-David & Menachem Magidor - 1986 - Journal of Symbolic Logic 51 (4):1029 - 1033.
  • Combinatorial principles in the core model for one Woodin cardinal.Ernest Schimmerling - 1995 - Annals of Pure and Applied Logic 74 (2):153-201.
    We study the fine structure of the core model for one Woodin cardinal, building of the work of Mitchell and Steel on inner models of the form . We generalize to some combinatorial principles that were shown by Jensen to hold in L. We show that satisfies the statement: “□κ holds whenever κ the least measurable cardinal λ of order λ++”. We introduce a hierarchy of combinatorial principles □κ, λ for 1 λ κ such that □κ□κ, 1 □κ, λ □κ, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   49 citations  
  • Adding closed cofinal sequences to large cardinals.Lon Berk Radin - 1982 - Annals of Mathematical Logic 22 (3):243.
  • Stationary reflection for uncountable cofinality.Péter Komjáth - 1986 - Journal of Symbolic Logic 51 (1):147-151.
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
  • Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor.Arthur W. Apter - 2000 - Mathematical Logic Quarterly 46 (4):453-460.
    Starting with a model in which κ is the least inaccessible limit of cardinals δ which are δ+ strongly compact, we force and construct a model in which κ remains inaccessible and in which, for every cardinal γ < κ, □γ+ω fails but □γ+ω, ω holds. This generalizes a result of Ben-David and Magidor and provides an analogue in the context of strong compactness to a result of the author and Cummings in the context of supercompactness.
     
    Export citation  
     
    Bookmark   1 citation