go-v.orgcodex
Menu
Page tools

codex · Philosophy

Total order

In mathematics, a total order or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation ≤ on some set X, which satisfies the following for all a,b and c in X:

a≤a (reflexive). If a≤b and b≤c then a≤c (transitive). If a≤b and b≤a then a=b (antisymmetric). a≤b or b≤a (strongly connected, formerly called totality). Requirements 1. to 3. just make up the definition of a partial order. Reflexivity (1.) already follows from strong connectedness (4.), but is required explicitly by many authors nevertheless, to indicate the kinship to partial orders. Total orders are sometimes also called simple, connex, or full orders. A set equipped with a total order is a totally ordered set; the terms simply ordered set, linearly ordered set, toset and loset are also used.

The term chain is sometimes defined as a synonym of totally ordered set, but generally refers to a totally ordered subset of a given partially ordered set. An extension of a given partial order to a total order is called a linear extension of that partial order.

Wikipedia contributors, "Total order", Wikipedia, revision 1386392983, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex