Complete partial ordering




<theory> (cpo) A partial ordering of a set under a relation, where all directed {subsets} have a least upper bound.

A cpo is usually defined to include a least element, bottom (David Schmidt calls this a pointed cpo).

A cpo which is algebraic and boundedly complete is a (Scott) domain.



< Previous Terms Terms Containing complete partial ordering Next Terms >
complete graph
complete inference system
complete lattice
complete metric space
completeness
 complete
cpo
 complete theory
complete unification
Complex Instruction Set Computer
complexity
complexity analysis