Welcome guest
You're not logged in.
296 users online, thereof 1 logged in

Definition: Strict Total Order, Strictly Ordered Set

A total order “$\prec$”, in which the property of being reflexive is replaced by the property of being irreflexive is called a strict total order (or trichotomous order).

In a trichotomous order, for all elements \(a,b\in V\) exactly one of the following cases holds:

  • Either $a \prec b$ ($a$ is smaller than $b$),
  • or $a \succ b$ ($a$ is greater than $b$),
  • or $a=b$ ($a$ equals $b$).

A chain $V$ with a strict total order is called a strictly ordered set. A strict total order is sometimes also called

| | | | | Contributors: bookofproofs | References: [979]


This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

[979] Reinhardt F., Soeder H.: “dtv-Atlas zur Mathematik”, Deutsche Taschenbuch Verlag, 1994, 10

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.