a precedes b if start of a is before the start of b irreflecive antisymmetric transitive ordering ensure one will always be true
a precedes b if start of a is before the start of b irreflecive antisymmetric transitive ordering ensure one will always be true
a weak partially-ordered relation r on set a is a total order if every pair of elements a, b ∈ a are comparable.