Set-theoretic tree
= Set-theoretic tree
A <partial order> in which the strict predecessors of each node form a <well-order>. The height of a node is the <order type> of its predecessors; nodes of a common height form a level. This order-theoretic meaning is distinct from a graph-theoretic <tree>.