Switch to: Citations

Add references

You must login to add references.
  1. A general Mitchell style iteration.John Krueger - 2008 - Mathematical Logic Quarterly 54 (6):641-651.
    We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on ω2.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Internal approachability and reflection.John Krueger - 2008 - Journal of Mathematical Logic 8 (1):23-39.
    We prove that the Weak Reflection Principle does not imply that every stationary set reflects to an internally approachable set. We show that several variants of internal approachability, namely, internally unbounded, internally stationary, and internally club, are not provably equivalent.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Aronszajn trees on [aleph]2 and [aleph]3.Uri Abraham - 1983 - Annals of Mathematical Logic 24 (3):213.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Nonsplitting subset of κ.Moti Gitik - 1985 - Journal of Symbolic Logic 50 (4):881-894.
    Assuming the existence of a supercompact cardinal, we construct a model of ZFC + ). Answering a question of Uri Abraham [A], [A-S], we prove that adding a real to the world always makes P ℵ 1 - V stationary.
    Download  
     
    Export citation  
     
    Bookmark   16 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  
  • Canonical structure in the universe of set theory: part one.James Cummings, Matthew Foreman & Menachem Magidor - 2004 - Annals of Pure and Applied Logic 129 (1-3):211-243.
    We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we prove a form of “singular cardinal compactness” for Jensen's square principle. We then study the relationship between internally approachable and tight structures, which parallels to a certain extent the relationship between good and approachable points. In particular we characterise the tight structures in terms of PCF theory and use our characterisation to prove (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • On the size of closed unbounded sets.James E. Baumgartner - 1991 - Annals of Pure and Applied Logic 54 (3):195-227.
    We study various aspects of the size, including the cardinality, of closed unbounded subsets of [λ]<κ, especially when λ = κ+n for n ε ω. The problem is resolved into the study of the size of certain stationary sets. Relative to the existence of an ω1-Erdös cardinal it is shown consistent that ωω3 < ωω13 and every closed unbounded subsetof [ω3]<ω2 has cardinality ωω13. A weakening of the ω1-Erdös property, ω1-remarkability, is defined and shown to be retained under a large (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Forcing closed unbounded sets.Uri Abraham & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):643-657.
    We discuss the problem of finding forcing posets which introduce closed unbounded subsets to a given stationary set.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Aronszajn trees on ℵ2 and ℵ3.Uri Abraham - 1983 - Annals of Mathematical Logic 24 (3):213-230.
    Assuming the existence of a supercompact cardinal and a weakly compact cardinal above it, we provide a generic extension where there are no Aronszajn trees of height ω 2 or ω 3 . On the other hand we show that some large cardinal assumptions are necessary for such a consistency result.
    Download  
     
    Export citation  
     
    Bookmark   37 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  
  • Co-stationarity of the Ground Model.Natasha Dobrinen & Sy-David Friedman - 2006 - Journal of Symbolic Logic 71 (3):1029 - 1043.
    This paper investigates when it is possible for a partial ordering P to force Pκ(λ) \ V to be stationary in VP. It follows from a result of Gitik that whenever P adds a new real, then Pκ(λ) \ V is stationary in VP for each regular uncountable cardinal κ in VP and all cardinals λ > κ in VP [4]. However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Combinatorial problems on trees: partitions, DELTA-systems and large free subtrees.M. Rubin - 1987 - Annals of Pure and Applied Logic 33 (1):43.
    Download  
     
    Export citation  
     
    Bookmark   9 citations