In descriptive set theory, a tree on a set
is a set of finite sequences of elements of
that is closed under subsequences.
More formally, it is a subset
of
, such that 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
. The set of all branches through
is denoted
.
A tree that has no branches is called wellfounded; a tree with at least one branch is illfounded.
A node (that is, element) of
is terminal if there is no node of
properly extending it; that is,
is terminal if there is no element
of
such that that
. A tree with no terminal nodes is called pruned.
Frequently trees on cartesian products
are considered. In this case, by convention, the set
is identified in the natural way with
, and
is considered as a subset of
. We may then form the projection of
,
![{\displaystyle p[T]=\{{\vec {x}}\in X^{\omega }|(\exists {\vec {y}}\in Y^{\omega })<{\vec {x}},{\vec {y}}>\in [T]\}}](/media/api/rest_v1/media/math/render/svg/c693bcaa795a8f81b32ba6b0e7f8db657a578c86)
See also