Content deleted Content added
m Reverted edits by 107.77.249.9 (talk) to last version by Omnipaedista |
Closing; no consensus for the merge, and the discussion has been stale for over 18 months; see Talk:Tree (descriptive set theory)#Merge With Tree (set theory) |
||
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.
| |||