Linked from

The 12 pages that link to Total order, each with the reason it gives.

• Partial orderCompared with: It adds comparability, the condition a general partial order may lack.

• Partially ordered setCompared with: It adds comparability for every pair, which a partial order does not require.

• Binary relationBroader topic: It models a relation that consistently ranks every pair of elements.

• Well-founded relationCompared with: Totality is independent of well-foundedness: a well-founded relation can leave pairs incomparable.

• Lattice (order theory)Compared with: Every total order is a lattice, but lattices can contain incomparable elements.

• Merge sortRelated: Merge sort requires a consistent ordering to decide which item comes next.

• Strict partial orderCompared with: It combines reflexive ordering with the comparability absent from partial orders generally.

• Antisymmetric relationBroader topic: Total orders add comparability to the antisymmetric partial-order conditions.

• Chain (order theory)Related: The order induced on a chain is total.

• Order theoryCompared with: Total orders contrast with the incomparable pairs allowed by general partial orders.

• Well-orderNarrower topic: Every well-order is total, but totality alone does not guarantee least elements for all subsets.

• Greatest element and least elementRelated: In a total order, greatest and least elements coincide with the familiar largest and smallest values.