Difference between revisions of "Total order"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematics, a '''linear order''', '''total order''', '''simple order''', or '''(non-strict) ordering''' is a binary relation on some set {\displaystyle X} X, which is...") |
(No difference)
|
Latest revision as of 13:29, 30 August 2016
In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation on some set {\displaystyle X} X, which is transitive, antisymmetric, and total (this relation is denoted here by infix {\displaystyle \leq } \leq ).
A set paired with a total order is called a totally ordered set, a linearly ordered set, a simply ordered set, or a chain.
See also
- Order theory
- Well-order
- Suslin's problem
- Countryman line
- Prefix order – a downward total partial order
External links
- Total order @ Wikipedia.org
