Suslin Trees
Suslin Trees is a type of tree order in set theory characterized as an uncountable, complete, dense linear order without endpoints that satisfies the countable chain condition yet contains no uncountable branches or antichains.
6
Publications
248
Citations
12
Authors
8
Institutions
Publications per year
2017–2026
0
Variants
Suslin Tree
Parents
6
Algorithms for the Quillen-Suslin theorem
Alessandro Logar, Bernd Sturmfels · Journal of Algebra · 1992 · 95 citations
Algorithmic aspects of Suslin's proof of Serre's conjecture
Leandro Caniglia, Guillermo Corti�as, Joos Heintz et al. · Computational Complexity · 1993 · 32 citations
A New Proof of a Theorem of Suslin
A. Mazzoleni · K-Theory · 2005 · 16 citations
Natural Sciences, Secondary Education, Separation Of Powers +4
1–5 of 6
12
1
h-index
South Dakota School of Mines and Technology, United States
1 publications · 95 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 12
8
Fundación Ciencias Exactas y Naturales
Buenos Aires, Argentina
1 h-index
6 publications
192 citations

Tata Institute of Fundamental Research
Mumbai, India
1 h-index
1 publications
71 citations

University of Trieste
Trieste, Italy
1 h-index
1 publications
95 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
1 publications
10 citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
1 h-index
1 publications
24 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
10 citations

University of East Anglia
Norwich, United Kingdom
1 h-index
1 publications
10 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
95 citations
1–8 of 8
1 publications · 16 citations
1
h-index
1 publications · 24 citations
1
h-index
1 publications · 95 citations
1
h-index
CC · 1 publications · 32 citations
1
h-index
1 publications · 71 citations
1
h-index
1–5