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...") |
Karl Jones (Talk | contribs) (→See also) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
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. | 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: | ||
| + | |||
| + | * [[Tree (data structure)]] | ||
== See also == | == See also == | ||
| Line 19: | Line 25: | ||
== External links == | == External links == | ||
| − | * [https://en.wikipedia.org/wiki/Tree_(set_theory) | + | * [https://en.wikipedia.org/wiki/Tree_(set_theory) Tree (set theory)] @ Wikipedia |
[[Category:Mathematics]] | [[Category:Mathematics]] | ||
[[Category:Set theory]] | [[Category:Set theory]] | ||
Latest revision as of 16:12, 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.
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
