Skip to search formSkip to main contentSkip to account menu

Suslin tree

Known as: Souslin tree 
In mathematics, a Suslin tree is a tree of height ω1 such thatevery branch and every antichain is at most countable. They are named after Mikhail… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Aronszajn treeKurepa treeTree (set theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Torsion and divisibility for reciprocity sheaves and 0-cycles with modulus
2014
2014
Preservation of a Souslin tree and side conditions
We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions… 
2012
2012
SOME RESULTS IN THE EXTENSION WITH A COHERENT SUSLIN TREE (Aspects of Descriptive Set Theory)
In [20], Stevo Todor\v{c}evi\v{C} introduced the forcing axiom PFA $(S)$ , which says that there exists a coherent Suslin tree $S… 
2008
2008
Rudin's Dowker space in the extension with a Suslin tree
We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle rening… 
2008
2008
ON A REFINEMENT OF ANTI-SOUSLIN TREE PROPERTY To the memory of thelate Dr
The field of uncountable trees contains so many unusual parts that has provided various examples and counter-examples in the… 
2001
2001
Terminal notions in set theory
Review
1998
Review
1998
Multi-dimensional Filter Banks and Wavelets—A System Theoretic Perspective
1997
1997
Projective Forcing
1992
1992
Lusin-Sierpiński index for the internal sets
Abstract We prove that there exists a function f which reduces a given subset P of an internal set X of an ω1 saturated… 
1984
1984
Characterizing weak compactness
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)