Handbook of logic in computer science (vol. 3): semantic structures
Handbook of logic in computer science (vol. 3): semantic structures
The bounded-complete hull of an &agr;-space
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Theory of Domains and Nearby (Invited Paper)
Proceedings of the International Conference on Formal Methods in Programming and Their Applications
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Compactly generated domain theory
Mathematical Structures in Computer Science
Presenting Dcpos and Dcpo Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
In this article, we show how separately continuous algebraic operations on T"0-spaces and the laws that they satisfy, both identities and inequalities, can be extended to theD-completion, that is, the universal monotone convergence space completion. Indeed we show that the operations can be extended to the lattice of closed sets, but in this case it is only the linear identities that admit extension. Via the Scott topology, the theory is shown to be applicable to dcpo-completions of posets. We also explore connections with the construction of free algebras in the context of monotone convergence spaces.