Strict Order Relation

A Strict Order Relation is a Transitive Antisymmetric Irreflexive Binary Relation.

• AKA: Strict Partial Order Relation, Strict Order, Strict Partial Order.
• Context:
  • It is a Partial Order Relation, that is also an Irreflexive Relation.
  • It can be:
    • a Total Strict Order Relation.
    • a Non-Total Strict Order Relation.
• Example(s):
  • A GreaterThan Relation, associated with a Strictly Ordered Number Sequence.
  • An IsA Relation, such as a Family Tree Relation.
  • A PartOf Relation, such as in a Product Assembly.
  • …
• Counter-Example(s):
  • Any Weak Partial Order Relation, such as a GreaterThanOrEqualTo Relation.
• See: Graph Relation.

---