<theory> In domain theory, a complete partial order is algebraic if every element is the least upper bound of some chain of compact elements. If the set of compact elements is countable it is called omega-algebraic.


Last updated: 1995-04-25

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Alfl « algebra « ALGEBRAIC « algebraic » Algebraic Compiler and Translator » algebraic data type » Algebraic Interpretive Dialogue