Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • Mitchell's theorem revisited.Thomas Gilton & John Krueger - 2017 - Annals of Pure and Applied Logic 168 (5):922-1016.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
    Let κ denote a regular uncountable cardinal and NS the normal ideal of nonstationary subsets of κ. Our results concern the well-known open question whether NS fails to be κ + -saturated, i.e., are there κ + stationary subsets of κ with pairwise intersections nonstationary? Our first observation is: Theorem. NS is κ + -saturated iff for every normal ideal J on κ there is a stationary set $A \subseteq \kappa$ such that $J = NS \mid A = \{X \subseteq (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Two applications of finite side conditions at omega _2.Itay Neeman - 2017 - Archive for Mathematical Logic 56 (7-8):983-1036.
    We present two applications of forcing with finite sequences of models as side conditions, adding objects of size \. The first involves adding a \ sequence and variants of such sequences. The second involves adding partial weak specializing functions for trees of height \.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Forcing with adequate sets of models as side conditions.John Krueger - 2017 - Mathematical Logic Quarterly 63 (1-2):124-149.
    We present a general framework for forcing on ω2 with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial segment. We give several examples of this type of forcing, including adding a function on ω2, adding a nonreflecting stationary subset of, and adding an ω1‐Kurepa tree.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Forcing with finite conditions.Gregor Dolinar & Mirna Džamonja - 2013 - Annals of Pure and Applied Logic 164 (1):49-64.
    We give a construction of the square principle by means of forcing with finite conditions.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Quotients of strongly proper forcings and guessing models.Sean Cox & John Krueger - 2016 - Journal of Symbolic Logic 81 (1):264-283.
    Download  
     
    Export citation  
     
    Bookmark   7 citations