Tree (descriptive set theory)
From Wikipedia, the free encyclopedia
This article is about mathematical trees described by prefixes of finite sequences. For trees described by partially ordered sets, see Tree (set theory).
In descriptive set theory, a tree on a set is a collection of finite sequences of elements of such that every prefix of a sequence in the collection also belongs to the collection.