Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by MyWigga04 to version by Peter M Gerdes. Report False Positive? Thanks, ClueBot NG. (2951966) (Bot) |
Undid revision 998041846 by Hellacioussatyr (talk) please do not convert properly formatted mathematics markup into junk pseudo-math templates |
||
| (11 intermediate revisions by 9 users not shown) | |||
Line 1:
{{about|mathematical trees described by prefixes of finite sequences|trees described by partially ordered sets|Tree (set theory)}}
In [[descriptive set theory]], a '''tree''' on a set <math>X</math> is a collection of [[finite sequence]]s of elements of <math>X</math> such that every [[Prefix (computer science)|prefix]] of a sequence in the collection also belongs to the collection.
Line 16 ⟶ 13:
A '''branch''' through a tree <math>T</math> is an infinite sequence of elements of <math>X</math>, each of whose finite prefixes belongs to <math>T</math>. The set of all branches through <math>T</math> is denoted <math>[T]</math> and called the '''''body''''' of the tree <math>T</math>.
A tree that has no branches is called '''''[[wellfounded]]'''''; a tree with at least one branch is '''''illfounded'''''. By [[
===Terminal nodes===
Line 42 ⟶ 39:
==References==
* {{Cite book| last = Kechris | first = Alexander S. | authorlink = Alexander S. Kechris | title = Classical Descriptive Set Theory | others = [[Graduate Texts in Mathematics]] 156 | publisher = Springer | year = 1995 | id =
{{DEFAULTSORT:Tree (Descriptive Set Theory)}}
| |||