Aronszajn Trees
Aronszajn Trees is a type of uncountable tree of height ω₁ with no uncountable branches and no uncountable levels, distinguished by satisfying the tree property while avoiding the existence of an uncountable well-ordered subset.
20
Publications
1K
Citations
20
Authors
20
Institutions
Publications per year
2017–2026
1
Variants
Aronszajn Tree
20
Partitioning pairs of countable ordinals
Stevo Todorčević · Acta Mathematica · 1987 · 247 citations · Full text
Uri Abraham · Annals of Pure and Applied Logic · 1983 · 65 citations
1–5 of 20
20
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 20
20
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
277 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
2 publications
165 citations
University of California, Irvine
Irvine, United States
2 h-index
2 publications
22 citations
University of Vienna
Vienna, Austria
2 h-index
2 publications
27 citations
Notre Dame of Dadiangas University
General Santos, Philippines
1 h-index
1 publications
10 citations
The University of Texas at Austin
Austin, United States
1 h-index
1 publications
27 citations

University of Notre Dame
Notre Dame, United States
1 h-index
1 publications
16 citations
Institute for Advanced Study
Berlin, Germany
1 h-index
1 publications
247 citations
1–8 of 20
4 publications · 204 citations
4
h-index
2 publications · 26 citations
2
h-index
TRAN · 2 publications · 35 citations
2
h-index
MLQ · 2 publications · 29 citations
2
h-index
1 publications · 42 citations
1
h-index
1–5