You are here: irt.org | FOLDOC | 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.

(1994-11-30)

Nearby terms: complete lattice « complete metric space « completeness « **complete partial ordering** » complete theory » complete unification » Complex Instruction Set Computer

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL