Total order

English

Noun

1. Template:Lb A partial order, ≤, (a binary relation that is reflexive, antisymmetric, and transitive) on some set S, such that any two elements of S are comparable (for any x, y ∈ S, either x ≤ y or y ≤ x).
   • Template:Quote-book
   • Template:Quote-book
   • 2013, Nick Huggett, Tiziana Vistarini, Christian Wüthrich, 15: Time in Quantum Gravity, Adrian Bardon, Heather Dyke (editors), A Companion to the Philosophy of Time, Wiley, 2016, Paperback, page 245,

     A binary relation R defines a total order on a set X just in case for all x, y, z ∈ X, the following four conditions obtain: (1) Rxx (reflexivity), (2) Rxy & Ryz → Rxz (transitivity), (3) Rxy & Ryx → x = y (weak antisymmetry), and (4) Rxy ∨ Ryx (comparability). Bearing in mind that the relata of the total order are not events in $ℰ$, but entire equivalence classes $ℰ/S$ of simultaneous events, it is straightforward to ask ≤ to be a total order of $ℰ/S$.

Synonyms

• Template:Sense Template:L, Template:L, Template:L, Template:L Template:Qualifier

Hypernyms

• Template:Sense
  • Template:L
    • preorder

Hyponyms

• Template:Sense
  • Template:L

Related terms

• Template:L
• Template:L

Translations

• Czech: Template:T, Template:T
• Esperanto: Template:T
• Finnish: Template:T
• German: Template:T, Template:T
• Polish: Template:T
• Spanish: Template:T

See also

• Template:L
• Template:L
• Template:L
• Template:L

Further reading

• Template:Pedia
• Template:Pedia
• Template:Pedia
• Template:Pedia
• Template:Pedia