Definition:Tree (Set Theory)

Definition
A tree is an ordered set $\left({T, \preceq}\right)$ such that for every $t \in T$, the lower closure of $t$:


 * $\bar\downarrow t = \left\{{s \in T: s \preceq t}\right\}$

is well-ordered by $\preceq$.

Branch
A branch of a tree is a maximal chain in it.

Subtree
A subtree of a tree $\left({T, \preceq}\right)$ is an ordered subset $\left({S, \preceq}\right)$ with the property that for every $s \in S$ and every $t \in T$ such that $t \preceq s$, $t \in S$.