Switch to: References

Citations of:

ℵ1-trees

Annals of Mathematical Logic 13 (3):267-330 (1978)

Add citations

You must login to add citations.
  1. Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
    In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Trees and Stationary Reflection at Double Successors of Regular Cardinals.Thomas Gilton, Maxwell Levine & Šárka Stejskalová - forthcoming - Journal of Symbolic Logic:1-31.
    We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa $, updating some classical constructions in the process. This includes models of $\mathsf {CSR}(\kappa ^{++})\wedge {\sf TP}(\kappa ^{++})$ (both with and without ${\sf AP}(\kappa ^{++})$ ) and models of the conjunctions ${\sf SR}(\kappa ^{++}) \wedge \mathsf {wTP}(\kappa ^{++}) \wedge {\sf AP}(\kappa ^{++})$ and $\neg {\sf AP}(\kappa ^{++}) \wedge {\sf SR}(\kappa ^{++})$ (the latter was originally obtained in joint work by Krueger and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Concerning the consistency of the Souslin hypothesis with the continuum hypothesis.Keith J. Devlin - 1980 - Annals of Mathematical Logic 19 (1):115.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Trees, subtrees and order types.Stevo B. Todorčević - 1981 - Annals of Mathematical Logic 20 (3):233.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Forcing and Consistency Results for Recursion in3E Together with Selection Over ℵ1.M. R. R. Hoole - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (7-9):107-115.
    Download  
     
    Export citation  
     
    Bookmark  
  • SH plus CH does not imply stationary antichains.Chaz Schlindwein - 2003 - Annals of Pure and Applied Logic 124 (1-3):233-265.
    We build a model in which the continuum hypothesis and Suslin's hypothesis are true, yet there is an Aronszajn tree with no stationary antichain.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
    In this paper we probe the possibilities of creating a Kurepa tree in a generic extension of a ground model of CH plus no Kurepa trees by an ω1-preserving forcing notion of size at most ω1. In Section 1 we show that in the Lévy model obtained by collapsing all cardinals between ω1 and a strongly inaccessible cardinal by forcing with a countable support Lévy collapsing order, many ω1-preserving forcing notions of size at most ω1 including all ω-proper forcing notions (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Results on the Generic Kurepa Hypothesis.R. B. Jensen & K. Schlechta - 1990 - Archive for Mathematical Logic 30 (1):13-27.
    K.J. Devlin has extended Jensen's construction of a model ofZFC andCH without Souslin trees to a model without Kurepa trees either. We modify the construction again to obtain a model with these properties, but in addition, without Kurepa trees inccc-generic extensions. We use a partially defined ◊-sequence, given by a fine structure lemma. We also show that the usual collapse ofκ Mahlo toω 2 will give a model without Kurepa trees not only in the model itself, but also inccc-extensions.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Variations on ◊.Keith J. Devlin - 1979 - Journal of Symbolic Logic 44 (1):51 - 58.
    Various equivalents and weakenings of the combinatorial principle $\diamond$ are considered. The paper contains both absolute results and consistency results. Also included is a new characterisation of the notion of a stationary subset of ω 1.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Singular σ-dense trees.Avner Landver - 1992 - Journal of Symbolic Logic 57 (4):1403-1416.
    Download  
     
    Export citation  
     
    Bookmark   1 citation