Handbook of logic in computer science (vol. 3)
Liminf convergence in &OHgr;-categories
Theoretical Computer Science
An axiomatic basis for computer programming
Communications of the ACM
A categorical generalization of Scott domains
Mathematical Structures in Computer Science
Towards "dynamic domains": Totally continuous cocomplete Q-categories
Theoretical Computer Science
| Hi-index | 0.00 |
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the dynamics of such a system, the updates of that system organize themselves quite naturally in a quantale, or more generally, a quantaloid. In fact, we are lead to consider cocomplete quantaloid-enriched categories as fundamental mathematical structure for a dynamic logic common to both computer science and physics. Here we explain the theory of totally continuous cocomplete categories as generalization of the well-known theory of totally continuous suplattices. That is to say, we undertake some first steps towards a theory of ''dynamic domains''.