Definition:Total Ordering

Let $$\left({S; \le}\right)$$ be a poset.

Then the ordering $$\le$$ is a total ordering on $$S$$ iff $$\left({S; \le}\right)$$ has no non-comparable pairs:

$$\forall x, y \in S: x \le y \lor y \le x$$