Characterizing topologies with bounded complete computational models. (English) Zbl 0924.68082
Brookes, Stephen (ed.) et al., Mathematical foundations of programming semantics. Proceedings of the 15th conference, Tulane Univ., New Orleans, LA, April 28 - May 1, 1999. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 20, electronic paper No. 13 (1999).
Summary: We give several characterizations of maximal point spaces of bounded continuous dcpos. Among them: they are regular second countable spaces which arise from a quasimetric whose dual gives rise to a compact space. In CFK, we use one of these characterizations to show that the Polish spaces are the maximal point spaces of bounded continuous dcpos.
For the entire collection see [Zbl 0921.00026].
For the entire collection see [Zbl 0921.00026].
MSC:
| 68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
