= Order theory
<Order theory> studies <binary relations> describing precedence or comparison. A <partial order> is reflexive, antisymmetric and transitive; a <total order> additionally compares every pair. A <partially ordered set> records a set together with its chosen order.
<Set inclusion> gives a <partial order> on the subsets of $\{1,2\}$. The subsets $\{1\}$ and $\{2\}$ are incomparable, while their <least upper bound> is their union. The usual order on the <real numbers> is total. Distinguishing a <maximum> from a merely <maximal element> is useful whenever incomparable alternatives occur, including dependencies, divisibility and optimization.
Back to article page