A relationship between equilogical spaces and type two effectivity

Mathematical Logic Quarterly

Volumn 48, Issue SUPPL. 1, 2002, Pages 1-15

  Bauer, Andrej ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036435280     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/1521-3870(200210)48:1+<1::AID-MALQ11111>3.0.CO;2-7     Document Type: Article

References (25)

1. Amadio, R. and P.-L. Curien, Domains and Lambda-Calculi, vol. 46 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
2. Awodey, S. and A. Bauer, Sheaf Toposes for Realizability (2000). Available at http://andrej.com/papers.
3. Awodey, S., L. Birkedal, and D. Scott, Local Realizability Toposes and a Modal Logic for Computability. In: Tutorial Workshop on Realizability Semantics, FLoC'99, Trento, Italy, 1999 (L. Birkedal, J. Van Oosten, G. Rosolini, and D. Scott, eds.), vol. 23 of Electronic Notes in Theoretical Computer Science, Elsevier, 1999.
4. Bauer, A., The Realizability Approach to Computable Analysis and Topology. Ph.D. thesis, Carnegie Mellon University (2000). Available as CMU technical report CMU-CS-00-164 and at http://andrej.com/thesis.
5. Bauer, A. and L. Birkedal, Continuous Functionals of Dependent Types and Equilogical Spaces. In: Computer Science Logic 2000, 2000. Available at http://andrej.com/papers.
6. Bauer, A., L. Birkedal, and D. Scott, Equilogical Spaces. Preprint submitted to Elsevier (1998).
7. Berger, U., Total Sets and Objects in Domain Theory. Annals of Pure and Applied Logic 60 (1993) 91-117. Available at http://www.mathematik.uni-muenchen.de/~berger/articles/apal/diss.dvi.Z.
8. Berger, U., Continuous Functionals of Dependent and Transitive Types. Habilitationsschrift, Ludwig-Maximilians-Universität München (1997).
9. Berger, U., Effectivity and Density in Domains: A Survey. In: Electronic Notes in Theoretical Computer Science (G.R. Lars Birkedal, Jaap Van Oosten and D.S. Scott, eds.), vol. 23, Elsevier Science Publishers, 2000.
10. Borceux, F., Handbook of Categorical Algebra I. Basic Category Theory, vol. 51 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1994.
11. Kleene, S., Countable Functionals. In: Constructivity in Mathematics, 1959, 81-100.
12. Kreitz, C. and K. Weihrauch, Theory of representations. Theoretical Computer Science 38 (1985) 35-53.
13. Kuratowski, C., Topologie. Warszawa, 1952.
14. 2 (1999). Available at http://www.mathematik.tu-darmstadt.de/̃lietz/comp.ps.gz.
15. Longley, J., Realizability Toposes and Language Semantics. Ph.D. thesis, University of Edinburgh (1994).
16. Menni, M. and A. Simpson, The Largest Topological Subcategory of Countably-based Equilogical Spaces. In: Preliminary Proceedings of MFPS XV, 1999. Available at http://www.dcs.ed.ac.uk/home/als/Research/.
17. Menni, M. and A. Simpson, Topological and Limit-space Subcategories of Countably-based Equilogical Spaces (2000). Submitted to Math. Struct. in Comp. Science.
18. Normann, D., Categories of Domains with Totality (1998). Available at http://www.math.uio.no/̃dnormann/.
19. Normann, D., The Continuous Functionals of Finite Types over the Reals. Preprint Series 19, University of Oslo (1998).
20. Schröder, M., Extended Admissibility. Theoretical Computer Science (2002). Forthcoming.
21. Scott, D., A New Category? (1996). Unpublished Manuscript. Available at http://www.cs.cmu.edu/Groups/LTC/.
22. Stoltenberg-Hansen, V., I. Lindström, and E. Griffor, Mathematical Theory of Domains. No. 22 in Cambridge Tracts in Computer Science, Cambridge University Press, 1994.
23. Weihrauch, K., Type 2 recursion theory. Theoretical Computer Science 38 (1985) 17-33.
24. Weihrauch, K., Computability, vol. 9 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987.
25. Weihrauch, K., Computable Analysis. Springer-Verlag, 2000.