Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • (2 other versions)Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
    Download  
     
    Export citation  
     
    Bookmark   329 citations  
  • Iterated perfectset forcing.J. E. Baumgartner - 1979 - Annals of Mathematical Logic 17 (3):271.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   270 citations  
  • Forcing with Sequences of Models of Two Types.Itay Neeman - 2014 - Notre Dame Journal of Formal Logic 55 (2):265-298.
    We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than $\aleph_{1}$, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important (...)
    Download  
     
    Export citation  
     
    Bookmark   24 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  
  • 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  
  • On the consistency strength of ‘Accessible’ Jonsson Cardinals and of the Weak Chang Conjecture.Hans-Dieter Donder & Peter Koepke - 1983 - Annals of Pure and Applied Logic 25 (3):233-261.
    Download  
     
    Export citation  
     
    Bookmark   15 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  
  • Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Woodin's axiom , bounded forcing axioms, and precipitous ideals on ω 1.Benjamin Claverie & Ralf Schindler - 2012 - Journal of Symbolic Logic 77 (2):475-498.
    If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at N₂ with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC-model. This yields that if Woodin's ℙ max axiom (*) holds, then BPFA implies that V is closed under the "Woodin-in-the-next-ZFC-model" operator. We also discuss stronger Mouse Reflection principles which we show to follow from strengthenings of BPFA, and we discuss the theory BPFA plus "NS ω1 is precipitous" and strengthenings (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations