First-order axiomatization of total orders (source code)

= First-order axiomatization of total orders

In the language with $\leq$, total orders are axiomatized by reflexivity, antisymmetry, transitivity, and totality
$$
\forall x\,\forall y\,(x\leq y\lor y\leq x).
$$