<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.
|< Previous Terms||Terms Containing algebraic||Next Terms >|
|algebraic data type
Algebraic Interpretive Dialogue
Algebraic Logic Functional language
Algebraic Manipulation Package
Algebraic Specification Language