Difference between revisions of "Tree (set theory)"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(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...")
 
(External links)
Line 19: Line 19:
 
== External links ==
 
== External links ==
  
* [https://en.wikipedia.org/wiki/Tree_(set_theory) Three (set theory)] @ Wikipedia
+
* [https://en.wikipedia.org/wiki/Tree_(set_theory) Tree (set theory)] @ Wikipedia
  
  
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]
 
[[Category:Set theory]]
 
[[Category:Set theory]]

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

External links