Free On-line Dictionary of Computing

total ordering

<mathematics >

A relation R on a set A which is a partial ordering; i.e. it is reflexive (xRx), transitive (xRyRz => xRz) and antisymmetric (xRyRx => x=y) and for any two elements x and y in A, either x R y or y R x. See also equivalence relation, well-ordered.

Last updated: 1995年02月16日

Nearby terms:

totally orderedtotally ordered settotal ordering tototouchpad

Try this search on Wikipedia, Wiktionary, Google, OneLook.



Loading

Quantcast

AltStyle によって変換されたページ (->オリジナル) /