e/Tree (set theory)

Information
has gloss	eng: In set theory, a tree is a partially ordered set (poset) (T, <) such that for each t ∈ T, the set s ∈ T : s < t} is well-ordered by the relation <. For each t ∈ T, the order type of s ∈ T : s < t} is called the height of t (denoted ht(t, T)). The height of T itself is the least ordinal greater than the height of each element of T. A root of a tree T is an element of height 0. Frequently trees are assumed to have only one root (as the typical questions that are investigated in this field are easily reduced to questions about single-rooted trees).
lexicalization	eng: Trees
lexicalization	eng: tree
subclass of	(noun) a tall perennial woody plant having a main trunk and branches forming a distinct elevated crown; includes both gymnosperms and angiosperms tree
has instance	e/Aronszajn tree
has instance	e/Honest leftmost branch
has instance	e/Kurepa tree
has instance	e/Laver tree
has instance	e/Suslin tree
has instance	e/Tree (descriptive set theory)