Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • 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  
  • 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  
  • Games played on Boolean algebras.Matthew Foreman - 1983 - Journal of Symbolic Logic 48 (3):714-723.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.David Asperó, John Krueger & Yasuo Yoshinobu - 2010 - Annals of Pure and Applied Logic 161 (1):94-108.
    We present several forcing posets for adding a non-reflecting stationary subset of Pω1, where λ≥ω2. We prove that PFA is consistent with dense non-reflection in Pω1, which means that every stationary subset of Pω1 contains a stationary subset which does not reflect to any set of size 1. If λ is singular with countable cofinality, then dense non-reflection in Pω1 follows from the existence of squares.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Saturated filters at successors of singulars, weak reflection and yet another weak club principle.Mirna Džamonja & Saharon Shelah - 1996 - Annals of Pure and Applied Logic 79 (3):289-316.
    Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds on a stationary (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Dense non-reflection for stationary collections of countable sets.David Asperó, John Krueger & Yasuo Yoshinobu - 2010 - Annals of Pure and Applied Logic 161 (1):94-108.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fragments of Martin's Maximum in generic extensions.Y. Yoshinobu & B. Konig - 2004 - Mathematical Logic Quarterly 50 (3):297.
    We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly -game-closed forcings. PFA can be destroyed by a strongly -game-closed forcing but not by an ω2-closed.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On a Generalization of Jensen's $square_kappa$, and Strategic Closure of Partial Orders.Dan Velleman - 1983 - Journal of Symbolic Logic 48 (4):1046-1052.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Kurepa trees and Namba forcing.Bernhard König & Yasuo Yoshinobu - 2012 - Journal of Symbolic Logic 77 (4):1281-1290.
    We show that strongly compact cardinals and MM are sensitive to $\lambda$-closed forcings for arbitrarily large $\lambda$. This is done by adding ‘regressive' $\lambda$-Kurepa trees in either case. We argue that the destruction of regressive Kurepa trees requires a non-standard application of MM. As a corollary, we find a consistent example of an $\omega_2$-closed poset that is not forcing equivalent to any $\omega_2$-directed-closed poset.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On a generalization of Jensen's □κ, and strategic closure of partial orders.Dan Velleman - 1983 - Journal of Symbolic Logic 48 (4):1046 - 1052.
    Download  
     
    Export citation  
     
    Bookmark   2 citations