COMPLETE PARTIAL ORDERING
\kəmplˈiːt pˈɑːʃə͡l ˈɔːdəɹɪŋ], \kəmplˈiːt pˈɑːʃəl ˈɔːdəɹɪŋ], \k_ə_m_p_l_ˈiː_t p_ˈɑː_ʃ_əl ˈɔː_d_ə_ɹ_ɪ_ŋ]\
Sort: Oldest first
-
(cpo) A partial ordering of a set under arelation, where all directed subsets have a least upperbound. A cpo is usually defined to include a least element,bottom (David Schmidt calls this a pointed cpo). A cpowhich is algebraic and boundedly complete is a (Scott)domain.
By Denis Howe
