# partial ordering

﻿
partial ordering

Philosophy dictionary. . 2011.

### Look at other dictionaries:

• 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 ordering relation — noun A partial order …   Wiktionary

• 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 order — noun A relation that is reflexive, antisymmetric, and transitive. Syn: partial ordering relation See Also: order, partially ordered set …   Wiktionary

• Partial fractions in complex analysis — In complex analysis, a partial fraction expansion is a way of writing a meromorphic function f(z) as an infinite sum of rational functions and polynomials. When f(z) is a rational function, this reduces to the usual method of partial… …   Wikipedia

• Complete partial order — In mathematics, directed complete partial orders and ω complete partial orders (abbreviated to dcpo, ωcpo or sometimes just cpo) are special classes of partially ordered sets, characterized by particular completeness properties. Complete partial… …   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

• 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