Computing (FOLDOC) dictionary
Jump to user comments
In domain theory, a complete partial order is algebraic if
every element is the lub of some chain of compact elements.
If the set of compact elements is countable it is
omega-algebraic. Usually written with a Greek letter omega
(1995-02-03)