Ideal models of spaces

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 277-297

  Martin, Keye ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Domain theory; Maximal elements; Models; Topology

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING; TOPOLOGY;

DOMAIN THEORY;

COMPUTER SCIENCE;

EID: 0042029618     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00698-9     Document Type: Conference Paper

References (30)

1. S. Abramsky, Total objects in domains, Unpublished notes, 1985.
2. S. Abramsky, A. Jung, Domain theory, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. III, Oxford University Press, Oxford, 1994.
3. F. Alessi, P. Baldan, F. Honsell, A category of compositional domain-models for separable stone spaces, Theoret. Comput. Sci. 2000, to appear.
4. G. Choquet, Lectures in Analysis, Vol. I, W.A. Benjamin, New York, 1969.
5. K. Ciesielski, R.C. Flagg, R. Kopperman, Characterizing topologies with bounded complete computational models, Proc. MFPS XV, Electronic Notes in Theoretical Computer Science, Vol. 20, Elsevier, Amsterdam, 1999.
6. Edalat A. Domain theory and integration. Theoret. Comput. Sci. 195:1995;163-193.
7. Edalat A. Dynamical systems, measures and fractals via domain theory. Inform. and Comput. 120:1995;32-48.
8. Edalat A. When Scott is weak on the top. Math. Struct. Comput. Sci. 7:1997;401-417.
9. Edalat A., Heckmann R. A computational model for metric spaces. Theoret. Comput. Sci. 193:1998;53-73.
10. Engelking R. General Topology. 1977;Polish Scientific Publishers, Warszawa.
11. B. Flagg, R. Kopperman, Computational models for ultrametric spaces, Proc. MFPS XIII, Electronic Notes in Theoretical Computer Science, Vol. 6, Elsevier, Amsterdam, 1997.
12. Harrington L., Kechris A.S., Louveau A. A Glimm-Effros dichotomy for Borel equivalence relations. J. Amer. Math. Soc. 3(4):1990;903-928.
13. Hofmann K.H., Mislove M.W. Local compactness and continuous lattices. Banaschewski B., Hofmann R.E. Continuous Lattices, Proc. Bremen 1979. Lecture Notes in Mathematics. Vol. 871:1981;209-248 Springer, Berlin.
14. Jung A., Sünderhauf P. Uniform approximation of topological spaces. Topol. Appl. 83:1998;23-37.
15. Kamimura T., Tang A. Total objects of domains. Theoret. Comput. Sci. 34:1984;275-288.
16. Kechris A. Classical Descriptive Set Theory. 1994;Springer, Berlin.
17. Lawson J. Spaces of maximal points. Math. Struct. Comput. Sci. 7:1997;543-555.
18. Lawson J. Computation on metric spaces via domain theory. Topol. Appl. 85:1998;247-263.
19. M. Alvarez-Manilla, Measure theoretic results for continuous valuations on partially ordered spaces, Ph.D. Thesis, Department of Computing, Imperial College, 2000.
20. K. Martin, Domain theoretic models of topological spaces, Proc. Comprox III, Electronic Notes in Theoretical Computer Science, Vol. 13, Elsevier, Amsterdam, 1998.
21. Martin K. Nonclassical techniques for models of computation. Topol. Proc. 24:1999.
22. K. Martin, A foundation for computation, Ph.D. Thesis, Department of Mathematics, Tulane University, 2000.
23. K. Martin, The measurement process in domain theory, Proc. 27 th Internat. Colloq. Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000.
24. K. Martin, A principle of induction, in: Lecture Notes in Computer Science, Vol. 2142, Springer, Berlin, 2001, pp. 201-218.
25. Martin K. A renee equation for algorithmic complexity. Lecture Notes in Computer Science. Vol. 2215:2001;Springer, Berlin.
26. Martin K. The space of maximal elements in a compact domain. Electronic Notes in Theoretical Computer Science. Vol. 40:2001;Elsevier, Amsterdam.
27. K. Martin, The regular spaces with countably based models, Theoret. Comput. Sci., submitted for publication.
28. Mislove M. Local dcpos, local cpos and local completions. Electronic Notes in Theoretical Computer Science. Vol. 20:1999;Elsevier, Amsterdam.
29. Scott D. Domains for denotational semantics. Nielsen M., Schmidt E.M. Proc. ICALP 1982. Lecture Notes in Computer Science. Vol. 140:1982;577-613 Springer, Berlin.
30. M. Smyth, Topology, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. I, Oxford University Press, Oxford, 1992, pp. 641-761.