Was (wer) ist complete partial order - definition
Complete partial order
TERM USED IN MATHEMATICAL ORDER THEORY
Directed complete partial order; Complete poset; Directed-complete poset; Directed-complete partially ordered set
In mathematics, the phrase complete partial order is variously used to refer to at least three similar, but distinct, classes of partially ordered sets, characterized by particular completeness properties. Complete partial orders play a central role in theoretical computer science: in denotational semantics and domain theory.
Chain-complete partial order
POSET COMPLETION
Chain complete; Chain completeness
In mathematics, specifically order theory, a partially ordered set is chain-complete if every chain in it has a least upper bound. It is ω-complete when every increasing sequence of elements (a type of countable chain) has a least upper bound; the same notion can be extended to other cardinalities of chains..
Partial derivative
DERIVATIVE OF A FUNCTION OF SEVERAL VARIABLES WITH RESPECT TO ONE VARIABLE, WITH THE OTHERS HELD CONSTANT
Partial Derivatives; Partial derivatives; Partial differentiation; Partial derivation; Mixed partial derivatives; Mixed derivatives; Partial Derivative; Mixed partial derivative; Partial differential; Partial symbol; Partial differentiation; Del (∂); Cross derivative
In mathematics, a partial derivative of a function of several variables is its derivative with respect to one of those variables, with the others held constant (as opposed to the total derivative, in which all variables are allowed to vary). Partial derivatives are used in vector calculus and differential geometry.
