law of trichotomy
The law of trichotomy for a binary relation![]()
on a set is the property that
- •
for all , exactly one of the following holds: or or .
A binary relation satisfying the law of trichotomy is sometimes said to be trichotomous.Trichotomous binary relations are equivalent![]()
to tournaments
![]()
,although the study of tournaments is usually restricted to the finite case.
A transitive![]()
trichotomous binary relation is called a total order
![]()
, and is typically written .
The law of trichotomy for cardinal numbers![]()
is equivalent (in ZF) to the axiom of choice
![]()
(http://planetmath.org/AxiomOfChoice).