partial order

Noun

 * 1)   An ordering of the elements of a collection that behaves like that of the natural numbers by size, except that some elements may not be comparable (if all elements are comparable, it is called a total order);  a binary relation that is reflexive, antisymmetric, and transitive.
 * 2) * 1986, Kenneth R. Goodearl, Partially Ordered Abelian Groups with Interpolation,, Softcover reprint 2010, page xxi,
 * A partial order on a set X is any reflexive, antisymmetric, transitive relation on X. In most cases, partial orders are denoted ≤.
 * 1) * 1999, Paul A. S. Ward, An Online Algorithm for Dimension-Bound Analysis, Patrick Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, D. Ruiz (editors), Euro-Par ’99 Parallel Processing: 5th International Euro-Par Conference, Proceedings, Springer, 1685, page 144,
 * The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation.

Hyponyms

 * well-order
 * well-order

Translations

 * Czech:
 * Finnish: osittainen järjestys, osittaisjärjestys
 * German: Halbordnung, partielle Ordnung
 * Japanese: 半順序
 * Korean: 부분 순서
 * Russian: части́чный поря́док
 * Swedish: