|
|
|
|
ordering relation
|
(Definition)
|
|
|
Let be a set. An ordering relation is a relation on such that, for every
:
- Either
, or ,
- If
and , then ,
- If
and , then .
Equivalently, an ordering relation is a relation on which makes the pair into a totally ordered set. Warning: In some cases, an author may use the term “ordering relation” to mean a partial order instead of a total order.
Given an ordering relation , one can define a relation by: if and . The opposite ordering is the relation given by: if , and the relation is defined analogously.
|
"ordering relation" is owned by djao.
|
|
(view preamble)
Cross-references: total order, partial order, mean, term, totally ordered set, relation
There are 15 references to this entry.
This is version 4 of ordering relation, born on 2001-10-21, modified 2004-03-20.
Object id is 444, canonical name is OrderingRelation.
Accessed 10947 times total.
Classification:
| AMS MSC: | 03-00 (Mathematical logic and foundations :: General reference works ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|