Toward a Minimalist Foundation for Constructive Mathematics

From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics

Volumn 9780198566519, Issue , 2005, Pages

  Maietti, Maria Emilia ^a   Sambin, Giovanni ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Constructive mathematics; Constructive type theory; Proofs as programs correspondence; Topos theory; Zermelo fraenkel set theory

Indexed keywords

SET THEORY;

CONSTRUCTIVE MATHEMATICS; CONSTRUCTIVE TYPE THEORY; INTENSIONAL TYPE THEORY; PROOFS-AS-PROGRAMS; TOPOS THEORY; TYPE THEORY;

FORMAL LANGUAGES;

EID: 84920753707     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198566519.003.0006     Document Type: Chapter

References (41)

1. Sambin, G. and Valentini, S. (1998). Building up a toolbox for Martin-Löf's type theory: subset theory. In: Twenty-five years of constructive type theory, Proceedings of a Congress held in Venice, October 1995 (ed. Sambin, G. and Smith, J.), pp. 221-244. Oxford U. P.
2. Sambin, G. (2003). Some p0oints in formal topology. Theoretical Computer Science, 305(1-3), 347-408.
3. Sambin, G., Battilotti, G., and Faggian, C. (2000). Basic logic: reflection, symmetry, visibility. J Symbolic Logic, 65(3), 979-1013.
4. Sambin, G. (1987). Intuitionistic formal spaces -a first communication. Mathematical logic and its applications pp. 187-204.
5. Maietti, M. E. (1998, February). The type theory of categorical universes. PhD thesis. University of Padova.
6. Sambin G. (with the collaboration of Gebellato, S. and Martin-Löf, P. and Capretta, V), (2003, May). The basic picture; Preprint n. 08, Dipartimento di Matematica, Università di Padova.
7. Bishop, E. (1967). Foundations of Constructive Analysis. McGraw-Hill, New York.
8. Bishop, E. (1985). Schizophrenia in contemporary mathematics. In: Errett Bishop: reflections on him and his research (San Diego, Calif., 1983). (ed. M. Rosenblatt). Volume. 39 of Contemporary Mathematics. Amer. Math. Soc. pp. 1-32.
9. Bishop, E. and Bridges, D. (1985). Constructive analysis. Grundlehren derMath-ematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] Volume. 279. Springer-Verlag, Berlin.
10. Martin-Löf, P. (1970). Notes on Constructive Mathematics. Almqvist & Wiksell.
11. Coquand, T. (1997). Computational content of classical logic. In:Semantics and Logics of Computation (Cambridge, 1995). Volume. 14 of Publ. Newton Inst., pp. 33-78. Cambridge University Press, Cambridge.
12. Girard J.-Y. (with the collaboration of Lafont, Y and Taylor, P), (1989). Proofs and Types, Volume. 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge.
13. Scedrov, A. (1985). Intuitionistic set theory. In: Harvey Friedman' research on the foundations of mathematics. Volume. 117 of Stud. Logic Found. Math., pp. 257-284. North-Holland, Amsterdam.
14. Myhill, J. 1975 Constructive set theory. J Symbolic Logic, 40, 347-383.
15. Aczel, P. and Rathjen, M. Notes on constructive set theory. Mittag-Leffler Technical Report No.40, 2000/2001.
16. Troelstra, A. and Dalen, D. van. (1988) Constructivism in mathematics. An Introduction. Vol. II. Volume 123 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam.
17. Martin-Löf, P. (1984). Intuitionistic Type Theory. Notes by G. Sambin of a series of lectures given in Padua, June 1980. Bibliopolis, Naples.
18. Nordstrom, B., Peterson, K., and Smith, J. (1990). Programming in Martin Lösf'Type Theory. Clarendon Press, Oxford.
19. Martin-Löf, P. (1998). An intuitionistic theory of types. In: Twenty five years of Constructive Type Theory (ed. Sambin G. and Smith, J.), pp. 127-172. Oxford Science Publications.
20. Johnstone, P. T. (2002b). Sketches of an Elephant: A Topos Theory Compendium. Vol. 2. Volume. 44, Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York.
21. Johnstone, P. T. (2002a). Sketc hes of an elephant: a topos theory compendium. Vol. 1. Volume. 43, of Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York.
22. Coquand, T. (1990). Metamathematical investigation of a calculus of constructions. In: Logic in Computer Science. (ed. P. Odifreddi). pp. 91-122. Academic Press.
23. Diaconescu, R. (1975). Axiom of choice and complementation. Proc. Amer. Math., Soc., 51, 176-178.
24. Hyland, J. M. E. (1982). The effective topos. In: The L.E.J. Brouwer Centenary Symposium (Noordwijkerhout, 1981). Volume. 110 of Stud. Logic Foundations Math., pp. 165-216. North-Holland, Amsterdam-New York.
25. Goodman, N. Myhill, J. (1978). Choice implies excluded middle. Z Math Logik Grundlag Math, 24, 461.
26. Bell, J. L. (1988). Toposes and Local Set Theories: An Introduction. Oxford:Claredon Press.
27. Bell, J. (1997). Zorn' lemma and complete Boolean algebras in intuitionistic type theories. J Symbolic Logic, 62, 1265-1279.
28. Maietti, M. E. (2001). Modular correspondence between dependent type theories and categorical universes. Math Struct Comput Sci, to appear.
29. Maietti, M. E. and Valentini, S. (1999). Can you add powersets to Martin-Löf intuitionistic type theory? Mathematical Logic Quarterly, 45, 521-532.
30. Brouwer, L. E. J. (1975). Collected Works I. North Holland.
31. Martin-Löf, P. (1985). On the meanings of the logical constants and the justifications of the logical laws. In: Proceedings of the conference on mathematical logic (Siena, 1983/1984). Volume. 2, pp. 203-281. Reprinted in: Nordic J. Philosophical Logic, 1 (1996), no. 1, pages 11-60.
32. Aczel, P. and Gambino, N. (2002). Collection principles in dependent type theory. In: Types for Proofs and Programs (Durham, 2000). Volume. 2277 of Lecture Notes in Comput. Sci, pp. 1-23. Springer, Berlin.
33. Howard, W. A. (1980). The formulae-as-types notion of construction. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. pp.480-490. Academic Press, London-New York.
34. Luo, Z. (1994). Computation and Reasoning. A Type Theory for Computer Science., Volume. 11 of International Series of Monographs on Computer Science. The Clarendon Press, Oxford University Press, New York.
35. Hyland, J. M. E. (2002). Variations on realizability: realizing the propositional axiom of choice. Math Structures Comput Sci., 12, 295-317.
36. Swaen, M. D. G. (1992). A characterization of ML in many-sorted arithmetic with conditional application. J Symbolic Logic, 57, 924-953.
37. Swaen, M. D. G. (1991). The logic of first order intuitionistic type theory with weak sigma-elimination. J Symbolic Logic, 56, 467-483.
38. Moerdijk, I. and Palmgren, E. (2002). Type theories, toposes and constructive set theory: predicative aspects of ast. Annals of Pure and Applied Logic, 114(1-3), 155-201.
39. Coquand, T. (1990). On the analogy between propositions and types. In:Logical Foundations of Functional Programming, University of Texas at Austin Year of Programming, p. 393. Addison-Wesley, Reading, MA. Originally in LNCS 242.
40. Mitchell, J. C. and Plotkin, G. D. (1988). Abstract types have existential type. ACM Transactions Programming Languages and Systems, 10(3), 470-502.
41. Martin-Löf, P. and Sambin, G. (2005). Generating positivity by coinduction.