Tree (set theory)
From Wiki @ Karl Jones dot com
In set theory, a tree is a partially ordered set (T, <) such that for each t ∈ T, the set {s ∈ T : s < t} is well-ordered by the relation <.
Description
Frequently trees are assumed to have only one root (i.e. minimal element), as the typical questions investigated in this field are easily reduced to questions about single-rooted trees.
Do not confuse with
Do not confuse with:
See also
- Cantor tree
- Continuous graph
- Kurepa tree
- Partially ordered
- Prefix order
- Laver tree
- Set (mathematics)
- Tree (descriptive set theory)
- Well-ordered
External links
- Tree (set theory) @ Wikipedia
