The continuum as a formal space

Archive for Mathematical Logic

Volumn 38, Issue 7, 1999, Pages 423-447

  Negri, Sara ^a   Soravia, Daniele ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033446224     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050149     Document Type: Article

References (36)

1. Aczel, P.: An introduction to inductive definitions, in "Handbook of Mathematical Logic", J. Barwise ed., North-Holland, pp. 739-782, 1977.
2. Beeson, M. J.: "Foundations of Constructive Mathematics", Springer-Verlag, 1980.
3. Bishop, E.: "Foundations of Constructive Analysis", Mc Graw Hill, 1967.
4. Cederquist, J.: A machine-assisted formalization of Intuitionistic Pointfree Topology, Licentiate Thesis, Chalmers University, Göteborg, 1994.
5. Cederquist, J.: An implementation of the Heine-Borel covering theorem in Type Theory, in "Types for Proofs and Programs", Gimenez, E., Paulin-Mohring, C. (eds), Lecture Notes in Computer Science 1512, pp. 46-65, Springer, 1998.
6. Cederquist, J.: A machine assisted proof of the Hahn-Banach theorem, Chalmers University of Technology and University of Göteborg, 1997.
7. Cederquist, J., Coquand, T., Negri, S.: The Hahn-Banach theorem in type theory, in "Twenty-Five Years of Constructive Type Theory", Sambin, G., Smith, J. (eds), pp. 57-72, Oxford University Press, 1998.
8. Cederquist, J., Negri, S.: A constructive proof of the Heine-Borel covering theorem for formal reals, in "Types for Proofs and Programs", Berardi, S., Coppo, M. (eds), Lecture Notes in Computer Science 1158, pp. 62-75, Springer, 1996.
9. Coquand, T.: Computational content of classical logic, in "Semantics of Logics of Computation", Pitts, A.M., Dybjer, P. (eds), Cambridge University Press, 1997.
10. Coquand, T., Smith, J.: An application of constructive completeness, in "Types for Proofs and Programs", Berardi, S., Coppo, M. (eds), Lecture Notes in Computer Science 1158, pp. 62-75, Springer, 1996.
11. Dragalin, A.G.: "Mathematical Intuitionism", Translations of Mathematical Monographs, vol. 67, American Mathematical Society, Providence, Rhode Island, 1988.
12. Fourman, M.P., Grayson, R.J.: Formal spaces, in "The L. E. J. Brouwer Centenary Symposium", Troelstra, A.S, van Dalen, D. (eds), North Holland, Amsterdam, pp. 107-122, 1982.
13. Fourman, M.P., Hyland, J.M.E.: Sheaf models for analysis, in Fourman, M.P. et al. (eds), "Applications of Sheaves", Lecture Notes in Mathematics 753, pp. 280-301, 1979.
14. Heyting, A.: "Intuitionism, an Introduction", North Holland, 1971.
15. Johnstone, P.T.: "Stone Spaces", Cambridge University Press, 1982.
16. Martin-Löf, P.: "Notes on Constructive Mathematics", Almqvist & Wiksell, Stockholm, 1970.
17. Martin-Löf, P.: Constructive mathematics and computer programming, in "Logic, Methodology and Philosophy of Science VI", Cohen, L.J. et al. (eds), pp. 153-175, North-Holland, 1982.
18. Martin-Löf, P.: The domain interpretation of type theory, in "Proceedings of the Workshop on Semantics of Programming Languages", Karlsson, K., Petersson, K. (eds), Chalmers University of Technology and University of Göteborg, 1983.
19. Martin-Löf, P.: "Intuitionistic Type Theory", Bibliopolis, Napoli, 1984.
20. Negri, S.: Stone bases, alias the constructive content of Stone representation, in "Logic and Algebra", Ursini, A., Aglianò, P. (eds), Marcel Dekker, New York, pp. 617-636, 1996.
21. Negri, S.: Continuous lattices informal topology, in "Types for Proofs and Programs", Gimenez, E., Paulin-Mohring, C. (eds), Lecture Notes in Computer Science 1512, pp. 333-353, Springer, 1998.
22. Negri, S., Valentini, S.: Tychonoff's theorem in the framework of formal topologies, The Journal of Symbolic Logic 62, pp. 1315-1332, 1997.
23. Nordström, B., Petersson, K., Smith, J.: "Programming in Martin-Löfs Type Theory", Oxford University Press, 1990.
24. von Plato, J.: Order in open intervals of computable reals, Mathematical Structures in Computer Science, in press.
25. Sambin, G.: Intuitionistic formal spaces - a first communication, in "Mathematical logic and its applications", D. Skordev ed., Plenum, pp. 187-204, 1987.
26. Sambin, G.: Pretopologies and completeness proofs,The Journal of Symbolic Logic 60, pp. 861-878, 1995.
27. Sambin, G., Valentini, S., Virgili, P.: Constructive domain theory as a branch of intuitionistic pointfree topology, Theoretical Computer Science, 159/2, pp. 319-341, 1996.
28. Scott, D.: Domains for denotational semantics, Lecture Notes in Computer Science, 140, pp. 577-613, Springer Verlag, 1982.
29. Sigstam, I.: "On formal spaces and their effective presentation", Ph. D. Thesis, Uppsala University, Department of Mathematics, Report 1990:7.
30. Sigstam, I.: Formal spaces and their effective presentation, Archive for Mathematical Logic, 34, pp. 211-246, 1995.
31. Smyth, M.B.: Topology, in "Handbook of Logic in Computer Science", S. Abramsky et al. (eds), Clarendon Press, Oxford, 1992.
32. Troelstra, A.S.: Intuitionistic extensions of the reals, part I, Nieuw Archief voor Wiskunde (3), 28, pp. 69-113, 1980.
33. Troelstra, A.S.: Intuitionistic extensions of the reals, part II, in "Logic Colloquium '80", van Dalen, D. et al. (eds), pp. 279-310, North-Holland, 1982.
34. Troelstra, A.S., van Dalen, D.: "Constructivism in Mathematics, an Introduction", vols. I and II, North-Holland, 1988.
35. Vermeulen, J.J.C.: "Constructive Techniques in Functional Analysis", Ph. D. Thesis, University of Sussex, 1986.
36. Vickers, S.: "Topology via Logic", Cambridge University Press, 1989.