aka simple or linear order

A total ordering is a binary Relation in a set $X$, defined as a Partial ordering, $\preceq$, such that for any $x, y \in X$ either $x \preceq y$ or $y \preceq x$ (all pairs of elements are comparable). The set is then said to be totally ordered.