partial ordering


noun Mathematics.

a relation defined on a set, having the properties that each element is in relation to itself, the relation is transitive, and if two elements are in relation to each other, the two elements are equal.

Origin of partial ordering

First recorded in 1940–45