total order
ordering relation where all elements can be compared; binary relation on some set, which is antisymmetric, transitive, and total
path ordering
in term rewriting, a well-founded strict total order (>) on the set of all terms
less than or equal to
having a smaller value or the same value as another item
well-order
total order such that every nonempty subset of the domain has a least element
greater than or equal to
having a greater value or the same value as another item
monomial order
order for the terms of a polynomial