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.
complete lattice « complete metric space «
complete partial ordering » complete theory »
complete unification » Complex Instruction Set