Jump to content

Tree (descriptive set theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Trovatore (talk | contribs) at 01:02, 8 July 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In descriptive set theory, a tree on a set is a subset of (that is, a set of finite sequences of elements of ) that is closed under subsequence (that is, if and , then ). A branch through is an infinite sequence of elements of such that, for every natural number , , where denotes the sequence of the first elements of .