Switch to: References

Citations of:

Trees

Journal of Symbolic Logic 36 (1):1-14 (1971)

Add citations

You must login to add citations.
  1. Trees, subtrees and order types.Stevo B. Todorčević - 1981 - Annals of Mathematical Logic 20 (3):233.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Compact extensions of L(Q).Menachem Magidor & Jerome Malitz - 1977 - Annals of Mathematical Logic 11 (2):217--261.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Closed Maximality Principles and Generalized Baire Spaces.Philipp Lücke - 2019 - Notre Dame Journal of Formal Logic 60 (2):253-282.
    Given an uncountable regular cardinal κ, we study the structural properties of the class of all sets of functions from κ to κ that are definable over the structure 〈H,∈〉 by a Σ1-formula with parameters. It is well known that many important statements about these classes are not decided by the axioms of ZFC together with large cardinal axioms. In this paper, we present other canonical extensions of ZFC that provide a strong structure theory for these classes. These axioms are (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
    By an ω1 we mean a tree of power ω1 and height ω1. An ω1-tree is called a Kurepa tree if all its levels are countable and it has more than ω1 branches. An ω1-tree is called a Jech-Kunen tree if it has κ branches for some κ strictly between ω1 and $2^{\omega _1 }$ . In Sect. 1, we construct a model ofCH plus $2^{\omega _1 } > \omega _2$ , in which there exists a Kurepa tree with not (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Essential Kurepa trees versus essential Jech–Kunen trees.Renling Jin & Saharon Shelah - 1994 - Annals of Pure and Applied Logic 69 (1):107-131.
    By an ω1-tree we mean a tree of cardinality ω1 and height ω1. An ω1-tree is called a Kurepa tree if all its levels are countable and it has more than ω1 branches. An ω1-tree is called a Jech–Kunen tree if it has κ branches for some κ strictly between ω1 and 2ω1. A Kurepa tree is called an essential Kurepa tree if it contains no Jech–Kunen subtrees. A Jech–Kunen tree is called an essential Jech–Kunen tree if it is no (...)
    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  
  • Some combinatorial problems concerning uncountable cardinals.Thomas J. Jech - 1973 - Annals of Mathematical Logic 5 (3):165.
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • Forcing with trees and order definability.Thomas J. Jech - 1975 - Annals of Mathematical Logic 7 (4):387.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Long projective wellorderings.Leo Harrington - 1977 - Annals of Mathematical Logic 12 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Extensions Immèdiates de Chaînes.Jean Guillaume - 1982 - Mathematical Logic Quarterly 28 (1-3):15-44.
    Download  
     
    Export citation  
     
    Bookmark  
  • ℵ1-trees.Keith J. Devlin - 1978 - Annals of Mathematical Logic 13 (3):267-330.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Consistency proofs in model theory: A contribution to Jensenlehre.John P. Burgess - 1978 - Annals of Mathematical Logic 14 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Souslin trees and successors of singular cardinals.Shai Ben-David & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 30 (3):207-217.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Projective forcing.Joan Bagaria & Roger Bosch - 1997 - Annals of Pure and Applied Logic 86 (3):237-266.
    We study the projective posets and their properties as forcing notions. We also define Martin's axiom restricted to projective sets, MA, and show that this axiom is weaker than full Martin's axiom by proving the consistency of ZFC + ¬lCH + MA with “there exists a Suslin tree”, “there exists a non-strong gap”, “there exists an entangled set of reals” and “there exists κ < 20 such that 20 < 2k”.
    Download  
     
    Export citation  
     
    Bookmark   5 citations