Difference between revisions of "Tree (set theory)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "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 re...") |
(No difference)
|
Revision as of 16:11, 9 May 2016
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.
See also
- Cantor tree
- Continuous graph
- Kurepa tree
- Partially ordered
- Prefix order
- Laver tree
- Set (mathematics)
- Tree (descriptive set theory)
- Well-ordered
External links
- Three (set theory) @ Wikipedia
