Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • 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  
  • Adding Closed Unbounded Subsets of ω₂ with Finite Forcing.William J. Mitchell - 2005 - Notre Dame Journal of Formal Logic 46 (3):357-371.
    An outline is given of the proof that the consistency of a κ⁺-Mahlo cardinal implies that of the statement that I[ω₂] does not include any stationary subsets of Cof(ω₁). An additional discussion of the techniques of this proof includes their use to obtain a model with no ω₂-Aronszajn tree and to add an ω₂-Souslin tree with finite conditions.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Remarks on superatomic Boolean algebras.J. E. Baumgartner - 1987 - Annals of Pure and Applied Logic 33 (2):109.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Coherent adequate forcing and preserving CH.John Krueger & Miguel Angel Mota - 2015 - Journal of Mathematical Logic 15 (2):1550005.
    We develop a general framework for forcing with coherent adequate sets on [Formula: see text] as side conditions, where [Formula: see text] is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent adequate type forcings. The main theorem of the paper is that any coherent adequate type forcing preserves CH. We show that there exists a forcing poset for adding a club subset of [Formula: see text] with finite conditions while preserving CH, solving (...)
    Download  
     
    Export citation  
     
    Bookmark   7 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  
  • Remarks on superatomic boolean algebras.James E. Baumgartner & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):109-129.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Chang’s Conjecture and weak square.Hiroshi Sakai - 2013 - Archive for Mathematical Logic 52 (1-2):29-45.
    We investigate how weak square principles are denied by Chang’s Conjecture and its generalizations. Among other things we prove that Chang’s Conjecture does not imply the failure of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}, i.e. Chang’s Conjecture is consistent with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}.
    Download  
     
    Export citation  
     
    Bookmark   7 citations