algebraic
<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.
[Significance?]
(1995-04-25)
Nearby terms:
Alfl « algebra « ALGEBRAIC « algebraic »
algebraic data type » Algebraic Interpretive
Dialogue » Algebraic Logic Functional language
|
