Towards an axiomatization of orderings (Q687178)

The authors propose six criteria and claim that all well-known sets of specific orderings, such as linear and weak orderings, satisfy these six axioms. These criteria impose closeness of the set of relations with respect to permutation, conversion, concatenation, restriction and substitution. Further they study minimal extensions of a given set of relations which satisfy the axioms. They introduce a sufficient condition by which it is easy to check whether a set of relations is classifiably.