[1] : The Free On-line Dictionary of Computing (27 SEP 03)

complete partial ordering
     
         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.
     
        1994-11-30
     
     
see also:
partial ordering set relation directed subsets least upper bound 
bottom pointed cpo algebraic boundedly complete domain 

Ordering >> O Words
Ordering, definition of term: Ordering
ordering_pag1.html

Complete >> C Words
Complete, definition of term: Complete
complete_pag1.html

Partial >> P Words
Partial, definition of term: Partial
partial_pag1.html

Complete Blood >> C Words
Complete Blood, definition of term: Complete Blood
complete+blood_pag1.html