Some points in formal topology

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 347-408

  Sambin, Giovanni ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; SET THEORY; TOPOLOGY;

FORMAL TOPOLOGY;

COMPUTER SCIENCE;

EID: 0041528400     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00704-1     Document Type: Conference Paper

References (49)

1. Abramsky S., Jung A. Domain theory. Abramsky S., Gabbay D.M., Taibaum T.S.E. Handbook of Logic in Computer Science. Vol. 3:1994;1-168 Clarendon Press, Oxford.
2. G. Battilotti, G. Sambin, A uniform presentation of sup-lattices, quantales and frames by means of infinitary preordered sets, pretopologies and formal topologies, Preprint No. 19, Dipartimento di Matematica, Università di Padova, November 1993.
3. G. Battilotti, G. Sambin, Pretopologies and a uniform presentation of sup-lattices, quantales and frames, to appear.
4. Bishop E. Foundations of Constructive Analysis. 1967;McGraw-Hill, New York.
5. E. Bishop, Schizophrenia in contemporary mathematics, in: M. Rosenblatt (Eds.), Errett Bishop: Reflections on Him and His Research, San Diego, CA, 1983, Contemporary Mathematics, Vol. 39, Amer. Math. Soc. Providence, RI, 1985, pp. 1-32.
6. J. Cederquist, T. Coquand, Entailment relations and distributive lattices, in: Logic Colloquium '98, Lecture Notes in Logic, Vol. 13, Association of Symbolic Logic, Springer, Berlin, 2000, pp. 127-139.
7. Cederquist J., Coquand T., Negri S. The Hahn-Banach theorem in type theory. Sambin G., Smith J. Twenty-Five Years of Constructive Type Theory, Proc. Congr. held in Venice, October 1995. 1998;57-72 Oxford University Press, Oxford.
8. Coquand T. An intuitionistic proof of Tychonoff's theorem. J. Symbolic Logic. 57:1992;28-32.
9. Coquand T., Sadocco S., Sambin G., Smith J. Formal topologies on the set of first-order formulae. J. Symbolic Logic. 65:2000;1183-1192.
10. T. Coquand, G. Sambin, J. Smith, S. Valentini, Inductively generated formal topologies, Ann. Pure Appl. Logic, to appear.
11. G. Curi, Analisi costruttiva nella teoria dei tipi: topologie formali con diametro e distanza, Tesi di laurea in Matematica, Università di Padova, July 1998.
12. Curi G. Metric spaces in type theory via formal topology. Spreen D. Workshop on Domains IV, Rolandseck, Germany, 2-4 October 1998. Electronic Notes in Theoretical Computer Science. Vol. 35:2000;Elsevier Science, Amsterdam.
13. Curi G. The points of (locally) compact regular formal topologies. Schuster P., Berger U., Osswald H. Reuniting the Antipodes - Constructive and Nonstandard Views of the Continuum, Symp. Proc., San Servolo, Venice, May 16-22, 1999. Synthese Library. Vol. 306:2002;Kluwer, Dordrecht.
14. G. Curi, Constructive metrizability in point-free topology, 2002, Theoret. Comput. Sci.
15. Engelking R. Outline of General Topology. 1968;North-Holland, Amsterdam.
16. Fourman M.P., Grayson R.J. Formal Spaces. Troelstra A.S., van Dalen D. The L.E.J. Brouwer Centenary Symp. 1982;107-122 North-Holland, Amsterdam.
17. S. Gebellato, G. Sambin, The essence of continuity (the Basic Picture, II), Preprint No. 27, Dipartimento di Matematica, Università di Padova, December 2001.
18. S. Gebellato, G. Sambin, Pointfree Continuity and Convergence, (the Basic Picture, II), Vol. IV, 2001, first draft.
19. S. Gebellato, G. Sambin, The basic picture as invariance under transfer along a relation, (the Basic Picture, II), Vol. V, 2002, first draft.
20. Girard J. Linear Logic. Theoret. Comput. Sci. 50:1987;1-102.
21. Johnstone P.T. Stone Spaces. 1982;Cambridge University Press, Cambridge.
22. Kelley J.L. General Topology. 1955;van Nostrand, New York.
23. Maietti M.E. About effective quotients in constructive type theory. Altenkirch T., Naraschewski W., Reus B. Types for Proofs and Programs. TYPES '98. Lecture Notes in Computer Science. Vol. 1657:1999;164-178 Springer, Berlin.
24. Maietti M.E., Valentini S. Can you add power-sets to Martin-Löf's intuitionistic set theory? Math. Logic Quart. 45:1999;521-532.
25. Martin-Löf P. Notes on Constructive Mathematics. 1970;Almqvist & Wiksell, Stockholm.
26. P. Martin-Löf, Constructive Mathematics and Computer Programming, in: L. Cohen, J. L*oš, H. Pfeiffer, K. Podowski (Eds.), Logic, Methodology and Philosophy of Science, Vol. VI, North-Holland, Amsterdam, 1982, pp. 153-175.
27. P. Martin-Löf, Intuitionistic type theory. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980, Bibliopolis, Napoli, 1984.
28. Negri S., Soravia D. The continuum as a formal space. Arch. Math. Logic. 38:1999;423-447.
29. Negri S., Valentini S. Tychonoff's theorem in the framework of formal topologies. J. Symbolic Logic. 62:1997;1315-1332.
30. Nordström B., Petersson K., Smith J.M. Programming in Martin-Löf's Type Theory, An Introduction. 1990;Oxford University Press, Oxford.
31. Pratt V. Chu spaces and their interpretation as concurrent objects. van Leeuwen J. Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science. Vol. 1000:1995;392-405 Springer, Berlin.
32. Sambin G. Intuitionistic formal spaces - a first communication. Skordev D. Mathematical Logic and its Applications. 1987;187-204 Plenum Press, New York.
33. Sambin G. Pretopologies and completeness proofs. J. Symbolic Logic. 60:1995;861-878.
34. Sambin G. Formal topology and domains. Spreen D. Workshop on Domains IV, Rolandseck, Germany, 2-4 October 1998. Electronic Notes in Theoretical Computer Science. Vol. 35:2000;Elsevier Science, Amsterdam.
35. Sambin G. Steps towards a dynamic constructivism. Gärdenfors P., Kijania-Placek K., Wolenski J. Proc. XI Internat. Congr., Logic, Methodology and Philosophy of Science, Krakow, August 1999. 2002;261-284 Kluwer, Dortdrecht.
36. G. Sambin, The Basic Picture, a structure for topology, (the Basic Picture, II), I, Preprint No. 26, Dipartimento di Matematica, Università di Padova, December 2001.
37. G. Sambin, Basic topologies, formal topologies, formal spaces, (the Basic Picture, II), III, in preparation.
38. Sambin G., Gebellato S. A preview of the basic picture: a new perspective on formal topology. Altenkirch T., Naraschewski W., Reus B. Types for Proofs and Programs. TYPES '98. Lecture Notes in Computer Science. Vol. 1657:1999;194-207 Springer, Berlin.
39. Sambin G., Valentini S. Building up a toolbox for Martin-Löf's type theory: subset theory. Sambin G., Smith J. Twenty-Five Years of Constructive Type Theory, Proc. Congr., held in Venice, October 1995. 1998;221-244 Oxford University Press, Oxford.
40. Sambin G., Valentini S., Virgili P. Constructive domain theory as a branch of intuitionistic pointfree topology. Theoret. Comput. Sci. 159:1996;319-341.
41. Scott D.S. Domains for denotational semantics. Nielsen M., Schmidt E.M. Automata, Languages and programming. 1982;577-613 Springer, Berlin.
42. Sigstam I. Formal spaces and their effective presentations. Arch. Math. Logic. 34:1995;211-246.
43. M.B. Smyth, Topology, in: S. Abramsky, D.M. Gabbay, T.S.E. Taibaum (Eds.), Handbook of Logic in Computer Science, Vol. 1, Clarendon Press, Oxford, 1992, pp. 641-761.
44. B. Solito, Gli operatori di interno e di chiusura da un punto di vista costruttivo. Tesi di Laurea in Matematica, Università di Padova, October 1998.
45. D. Soravia, Numeri reali e analisi costruttiva nel contesto delle topologie formali. Tesi di Laurea in Matematica, Università di Padova, July 1995.
46. Valentini S. The forget-restore principle: a paradigmatic example. Sambin G., Smith J. Twenty-Five Years of Constructive Type Theory, Proc. Congr., held in Venice, October 1995. 1998;275-283 Oxford University Press, Oxford.
47. Valentini S. A cartesian closed category in Martin-Löf's intuitionistic type theory. Theoret. Comput. Sci. 290:2002;189-219.
48. Vickers S. Topology via Logic. Cambridge Tracts in Theoretical Computer Science. Vol. 5:1989;Cambridge University Press, Cambridge.
49. Weihrauch K., Schreiber U. Embedding metric spaces into cpo's. Theoret. Comput. Sci. 16:1981;5-24.