Total Strict Order Relation: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "<U>AKA</U>" to "AKA") |
m (Text replacement - "<U>Counter-Example(s)</U>" to "Counter-Example(s)") |
||
| Line 5: | Line 5: | ||
* <B><U>Example(s)</U>:</B> | * <B><U>Example(s)</U>:</B> | ||
** [[GreaterThan Relation]] associated to [[The Number Line]]. | ** [[GreaterThan Relation]] associated to [[The Number Line]]. | ||
* <B | * <B>Counter-Example(s):</B> | ||
** [[GreaterThanOrEqualTo Relation]] associated to [[The Number Line]]. | ** [[GreaterThanOrEqualTo Relation]] associated to [[The Number Line]]. | ||
* <B><U>See</U>:</B> [[Total Weak Order Relation]], [[Non-Total Strict Order Relation]]. | * <B><U>See</U>:</B> [[Total Weak Order Relation]], [[Non-Total Strict Order Relation]]. | ||
Revision as of 03:18, 11 September 2014
A Total Strict Order Relation is a Transitive Antisymmetric Irreflexive Binary Relation (a Partial Order Relation) that is also a Total Relation (for some given set).
- AKA: Total Strict Partial Order Relation, Strict Total Order Relation, Total Strict Partial Order.
- Context:
- It is associated to an Ordered Set.
- Example(s):
- GreaterThan Relation associated to The Number Line.
- Counter-Example(s):
- GreaterThanOrEqualTo Relation associated to The Number Line.
- See: Total Weak Order Relation, Non-Total Strict Order Relation.