Switch to: Citations

Add references

You must login to add references.
  1. Powers of regular cardinals.William B. Easton - 1970 - Annals of Mathematical Logic 1 (2):139.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   269 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Countable approximations and Löwenheim-Skolem theorems.David W. Kueker - 1977 - Annals of Mathematical Logic 11 (1):57.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Some combinatorial problems concerning uncountable cardinals.Thomas J. Jech - 1973 - Annals of Mathematical Logic 5 (3):165.
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • Morasses, diamond, and forcing.Daniel J. Velleman - 1982 - Annals of Mathematical Logic 23 (2):199.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Higher Souslin trees and the generalized continuum hypothesis.John Gregory - 1976 - Journal of Symbolic Logic 41 (3):663-671.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • A new class of order types.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (3):187-222.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Shelah's pcf theory and its applications.Maxim R. Burke & Menachem Magidor - 1990 - Annals of Pure and Applied Logic 50 (3):207-254.
    This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf={cf:D is an ultrafilter on a}, where a is a set of regular cardinals such that a
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • 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 □κ, λ □κ, (...)
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • A global version of a theorem of Ben-David and Magidor.Arthur W. Apter & James Cummings - 2000 - Annals of Pure and Applied Logic 102 (3):199-222.
    We prove a consistency result about square principles and stationary reflection which generalises the result of Ben-David and Magidor [4].
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Large cardinals and definable counterexamples to the continuum hypothesis.Matthew Foreman & Menachem Magidor - 1995 - Annals of Pure and Applied Logic 76 (1):47-97.
    In this paper we consider whether L(R) has “enough information” to contain a counterexample to the continuum hypothesis. We believe this question provides deep insight into the difficulties surrounding the continuum hypothesis. We show sufficient conditions for L(R) not to contain such a counterexample. Along the way we establish many results about nonstationary towers, non-reflecting stationary sets, generalizations of proper and semiproper forcing and Chang's conjecture.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • The tree property at successors of singular cardinals.Menachem Magidor & Saharon Shelah - 1996 - Archive for Mathematical Logic 35 (5-6):385-404.
    Assuming some large cardinals, a model of ZFC is obtained in which $\aleph_{\omega+1}$ carries no Aronszajn trees. It is also shown that if $\lambda$ is a singular limit of strongly compact cardinals, then $\lambda^+$ carries no Aronszajn trees.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Some exact equiconsistency results in set theory.Leo Harrington & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):178-188.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • The weak □* is really weaker than the full □.Shai Ben-David & Menachem Magidor - 1986 - Journal of Symbolic Logic 51 (4):1029 - 1033.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reflecting stationary sets.Menachem Magidor - 1982 - Journal of Symbolic Logic 47 (4):755-771.
    We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω ω + 1 (...)
    Download  
     
    Export citation  
     
    Bookmark   33 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  
  • Precipitous ideals.T. Jech, M. Magidor, W. Mitchell & K. Prikry - 1980 - Journal of Symbolic Logic 45 (1):1-8.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Games played on Boolean algebras.Matthew Foreman - 1983 - Journal of Symbolic Logic 48 (3):714-723.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A very weak square principle.Matthew Foreman & Menachem Magidor - 1997 - Journal of Symbolic Logic 62 (1):175-196.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Adding a closed unbounded set.J. E. Baumgartner, L. A. Harrington & E. M. Kleinberg - 1976 - Journal of Symbolic Logic 41 (2):481-482.
    Download  
     
    Export citation  
     
    Bookmark   26 citations