Interpreting classical theories in constructive ones

Journal of Symbolic Logic

Volumn 65, Issue 4, 2000, Pages 1785-1812

  Avigad, Jeremy ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034561991     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695075     Document Type: Article

References (23)

1. PETER ACZEL, The strength of Martin-Löfs intuitionistic type theory with one universe, Proceedings of the symposiums of mathematical logic, Oulu 1974 and Helsinki 1975 (Seppo Miettinen and Jouko Väänänen, editors), Department of Philosophy, University of Helsinki, 1977.
2. _, The type theoretic interpretation of constructive set theory, Logic colloquium '77 (A. Macintyre, L. Pacholski, and J. Paris, editors), North-Holland, Amsterdam, 1978, pp. 55-66.
3. _, The type theoretic interpretation of constructive set theory: choice principles L. E. J. Brouwer centenary symposium (A. S. Troelstra and D. van Dalen, editors), North-Holland, Amsterdam, 1982, pp. 1-40.
4. JEREMY AVIGAD and RICHARD SOMMER, The model-theoretic ordinal analysis of predicative theories, this JOURNAL, vol. 64 (1999), pp. 327-349.
5. JON BARWISE, Admissible sets and structures, Springer, Berlin, 1975.
6. MICHAEL J. BEESON, Foundations of constructive mathematics, Springer, Berlin, 1985.
7. μ+1-rule, [8], 1981, pp. 188-233.
8. WILFRIED BUCHHOLZ, SOLOMON FEFERMAN, WOLFRAM POHLERS, and WILFRIED SIEG, Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies, Lecture Notes in Mathematics, no. 897, Springer, Berlin, 1981.
9. WOLFGANG BURR, Fragments of Heyting-arithmetic, preprint, 1998.
10. STEPHEN A. COOK and ALASDAIR URQUHART, Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic, vol. 63 (1993), pp. 103-200.
11. THIERRY COQUAND and MARTIN HOFMANN, A new method for establishing conservative of classical systems over their intuitionistic version, Mathematical Structures in Computer Science, vol. 9 (1999), pp. 323-333.
12. HARVEY M. FRIEDMAN, Subsystems of set theory and analysis, Ph.D. thesis, Massachussetts Institute of Technology, 1967.
13. _, The consistency of classical set theory relative to a set theory with intuitionistic logic, this JOURNAL, vol. 38 (1973), no. 2, pp. 315-319.
14. _, Classically and intuitionistically provable functions, Higher set theory (H. Müller and D. Scott, editors), Lecture Notes in Mathematics, no. 669, Springer, Berlin, 1978, pp. 21-27.
15. E. GRIFFOR and M. RATHJEN, The strength of some Martin-Löf type theories, Archive for Mathematical Logic, vol. 33 (1994), pp. 347-385.
16. GERHARD JÄGER, Theories for admissible sets: A unifying approach to proof theory, Bibliopolis, Napoli, 1986.
17. PER MARTIN-LÖF, An intuitionistic theory of types, 1972, manuscript, reprinted in Twenty-five years of constructive type theory, Oxford University Press, 1998, pp. 127-172.
18. ERIK PALMGREN, Type-theoretic interpretation of iterated, strictly positive inductive definitions, Archive for Mathematical Logic, vol. 32 (1992), pp. 75-99.
19. ROHIT PARIKH, Existence and feasibility in arithmetic, this JOURNAL, vol. 36 (1971), pp. 494-508.
20. MICHAEL RATHJEN, The proof-theoretic characterization of the primitive recursive set functions, this JOURNAL, vol. 57 (1992), pp. 954-969.
21. STEPHEN G. SIMPSON, Subsystems of second-order arithmetic, Springer, Berlin, 1998.
22. A. S. TROELSTRA, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, no. 344, Springer, Berlin, 1973.
23. DIRK VAN DALEN, Logic and structure, third ed., Springer, Berlin, 1997.