# partial ordering relation

partial ordering relation

Wikipedia foundation.

### Look at other dictionaries:

• partial ordering — See ordering relation …   Philosophy dictionary

• ordering relation — A partial ordering on a set is a relation < that is transitive and reflexive and antisymmetric. That is, (i) x < y & y < z →x < z ; (ii) x < x ; (iii) x < y & y < x →x = y . If we add (iv) that at least one of x < y, x = y …   Philosophy dictionary

• partial ordering — Math. 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. [1940 45] * * * …   Universalium

• partial ordering — Math. 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. [1940 45] …   Useful english dictionary

• partial order — noun A relation that is reflexive, antisymmetric, and transitive. Syn: partial ordering relation See Also: order, partially ordered set …   Wiktionary

• Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… …   Wikipedia

• Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… …   Wikipedia

• Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… …   Wikipedia

• Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques …   Wikipedia

• Strict weak ordering — The 13 possible strict weak orderings on a set of three elements {a, b, c}. The only partially ordered sets are coloured, while totally ordered ones are in black. Two orderings are shown as connected by an edge if they differ by a single… …   Wikipedia