In set theory, a tree is a partially ordered set ( T , < ) {\displaystyle (T,<)} such that for each t ∈ T {\displaystyle t\in T} , the set { s ∈ T : s < t } {\displaystyle \{s\in T:s<t\}} is well-ordered by the relation < {\displaystyle <} . Frequently trees are assumed to have only one root (i.e.
In set theory, a tree is a partially ordered set ( T , < ) {\displaystyle (T,<)} such that for each t ∈ T {\displaystyle t\in T} , the set { s ∈ T : s < t } {\displaystyle \{s\in T:s<t\}} is well-ordered by the relation < {\displaystyle <} . Frequently trees are assumed to have only one root (i.e.
Source: Wikipedia "Tree (set theory)" · CC BY-SA 4.0
Share this article: X · Bluesky