A new method for establishing conservativity of classical systems over their intuitionistic version

Mathematical Structures in Computer Science

Volumn 9, Issue 4, 1999, Pages 323-333

  Coquand, Thierry ^a   Hofmann, Martin ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b Department of Computer Science   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85016922087     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002844     Document Type: Article

References (23)

1. Aczel, P., Simmons, H. and Wainer, S. (eds.) (1992) Proof Theory, Cambridge University Press.
2. Avigad, J. (1998) Interpreting classical theories in constructive ones. Preprint, available from http://macduff.andrew.emu.edu/avigad.
3. Burr, W. (1998) Fragments of Heyting-Arithmetic (to appear in Journal of Symbolic Logic).
4. Buchholz, W., Feferman, S., Pohlers, W. and Sieg, W. (1981) Iterated Inductive Definitions and Sub-systems of Analysis: Recent Proof-Theoretical Studies. Springer-Verlag Lecture Notes in Mathe-matics 897.
5. Buchholz, W. (1977) Some proof-theoretical results in the theories IDCV, IDiv, Preprint, March 1977.
6. Buss, S.R. (1990) On model theory for intuitionistic bounded arithmetic with applications to independence results. In: Buss, S.R. and Scott, P. J. (eds.) Feasible Mathematics, Birkhauser 27–47.
7. Buss, S. R. (1986) Bounded Arithmetic, Bibliopolis.
8. Cederquist, J. (1997) Formal Topology in Type Theory. Ph. D. thesis, Chalmers University.
9. A. Cobham (1965) The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Logic, Methodology, and Philosophy of Science II, Springer Verlag 24–30.
10. Cook, S. and Urquhart, A. (1993) Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic 63 103–200.
11. van Heijenoort, J. (ed.) (1971) From Frege to Godel, Harvard University Press.
12. Hilbert, D. (1971) The foundations of mathematics. In: van Heijenoort, J. (ed.) From Frege to Godel, Harvard University Press 465–479.
13. Jervell, H. R. (1998) A course in proof theory. (Manuscript, currently (April 1998) available at www.uio.no/Mierman/ptheory.ps.)
14. Johannsen, J. (1996) Schwache Fragmente der Arithmetik und Schwellwertschaltkreise beschreinkter Tiefe, Ph. D. thesis, Universitat Erlangen.
15. Johnstone, P. (1982) Stone Spaces, Cambridge University Press. Kohlenbach, U. (1992) Effective Bounds from Ineffective Proofs in Analysis: an Application of Functional Interpretation and Majorization. Journal of Symbolic Logic 1239–1273.
16. Parsons, C. (1970) On a number theoretic choice schema and its relation to induction. In: Kino, Myhill and Vesley (eds.) Intuitionism and Proof Theory, North-Holland 459–473.
17. Parsons, C. (1972) On n-quantifier induction. Journal of Symbolic Logic 37 466–482.
18. Pohlers, W. (1992) A short course in ordinal analysis. In: Aczel, P., Simmons, H. and Wainer, S. (eds.) Proof Theory, Cambridge University Press 27–78.
19. Sambin, G. (1996) A new and elementary method to represent every complete Boolean algebra. In: Ursini, A. and Agliano, P. (eds.) Logic and algebra (Pontignano, 1994). Lecture Notes in Pure and Appl. Math., Dekker, New York 180 655–665.
20. Tait, W. (1968) Normal Derivability in Classical Logic. In: Barwise, J. (ed.) Springer-Verlag Lecture Notes in Mathematics 72 204–236.
21. Troelstra, A. (1974) Note on the Fan Theorem. Journal of Symbolic Logic 39 584–596.
22. Troelstra, A., and van Dalen, D. (1988) Constructivism in Mathematics, vol. 2, North-Holland.
23. Wainer, S. and Wallen, L. (1992) Basic proof theory. In: Aczel, P. Simmons, H. and Wainer, S. (eds.) Proof Theory, Cambridge University Press 1–26.