Does reductive proof theory have a viable rationale?

Erkenntnis

Volumn 53, Issue 1-2, 2000, Pages 63-96

  Feferman, Solomon ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010736859     PISSN: 01650106     EISSN: 15728420     Source Type: Journal    
DOI: 10.1023/a:1005622403850     Document Type: Article

References (50)

1. Aczel, P.: 1978, 'The Type Theoretic Interpretation of Constructive Set Theory', in A. MacIntyre et al. (eds), Logic Colloquium '77, North-Holland, Amsterdam, pp. 55-66.
2. Arai, T.: 1996, 'Systems of Ordinal Diagrams', Preprint.
3. 1-Stability', Preprint.
4. Benacerraf, P. and H. Putnam eds.: 1983, Philosophy of Mathematics, 2nd edn. Cambridge University Press, Cambridge, U.K.
5. Buchholz, W.: 1991, 'Notation System for Infinitary Derivations', Archive for Mathematical Logic 30, 277-96.
6. Buchholz, W.: 1997, 'Explaining Gentzen's Consistency Proof within Infinitary Proof Theory', in KGC'97, Lecture Notes in Computer Science 1289, pp. 4-17.
7. Buchholz, W.: 1999, 'Explaining the Gentzen-Takeuti Reduction Steps: A Second Order System', Preprint; to appear in Archive for Mathematical Logic.
8. Buchholz, W., S. Feferman, W. Pohlers, and W. Sieg: 1981, Iterated Inductive Definitions and Subsystems of Analysis, Vol. 897, Lecture Notes in Mathematics.
9. Buss, S. R. ed.: 1998, Handbook of Proof Theory, North-Holland, Amsterdam.
10. Dupre, J.: 1993, The Disorder of Things, Harvard University Press, Cambridge.
11. Feferman, S.: 1960, Arithmetization of Metamathematics in a General Setting', Fundamenta Mathematicae 49, 35-92.
12. Feferman, S.: 1975, A Language and Axioms for Explicit Mathematics', in J. N. Crossley ed., Algebra and Logic, Vol. 450, Lecture Notes in Mathematics, pp. 87-139.
13. Feferman, S.: 1979, 'Constructive Theories of Functions and Classes', in M. Boffa et al. (eds), Logic Colloquium '78, North-Holland, Amsterdam, pp. 159-224.
14. Feferman, S.: 1984, Foundational Ways, in W. Jager et al. (eds), Perspectives in Mathematics, Birkhauser, Basel, pp. 147-85. Reprinted in Feferman 1998, 94-104.
15. Feferman, S.: 1988, 'Hilbert's Program Relativized. Proof-Theoretical and Foundational Reductions', J. Symbolic Logic 53, 364-84.
16. Feferman, S.: 1993, 'What Rests on What? The Proof-Theoretical Analysis of Mathematics', in J. Czermak, (ed.), Philosophy of Mathematics, Vol. I, Verlag-Holder-Pichler-Tempsky, Vienna, pp. 147-71. Reprinted in Feferman 1998, 187-208.
17. Feferman, S.: 1996, 'Kreisel's "Unwinding" Program', in P. Odifreddi (ed.), Kreiseliana, A. K. Peters Ltd., Wellesley, pp. 247-73.
18. Feferman, S.: 1998, In the Light of Logic, Oxford University Press, New York.
19. Feferman, S.: 1999, 'Does Mathematics Need New Axioms?', American Mathematical Monthly 106, 99-111.
20. Gentzen, G.: 1969, in M. E. Szabo (ed.), 'The Consistency of Elementary Number Theory',The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam.
21. 1-CA) + BI und verwandte Systeme', Sitzungsberichte der Bayerischen Akademie der Wissenschaften, pp. 1-28.
22. 0 of Explicit Mathematics: The Limit and Mahlo Axioms', Preprint.
23. Kreisel, G.: 1955, 'Models, Translations and Interpretations', in Th. Skolem et al. (eds), Mathematical Interpretation of Formal Systems, North-Holland, Amsterdam, pp. 26-50.
24. Kreisel, G.: 1958, 'Hilbert's Programme', Dialectica 12, 346-72. Revised, with Postscript in Benaceraff and Putnam 1983, pp. 207-238.
25. Kreisel, G.: 1968, A Survey of Proof Theory', J. Symbolic Logic 33, 321-88.
26. Kreisel, G.: 1987, 'Proof Theory: Some Personal Recollections', Appendix to Takeuti 1987, pp. 395-405.
27. Lindström, P.: 1997, 'Interpretability in Reflexive Theories - A Survey', Theoria 63(3), 182-209.
28. Martin-Löf, P.: 1984, Intuitionistic Type Theory, Bibliopolis, Naples.
29. Niebergall, K.-G.: 1999, 'Proof-Theoretical Reducibility', Preprint.
30. Niebergall, K.-G.: 2000, 'On the Logic of Reducibility: Axioms and Examples', This issue.
31. Oppenheim, P. and H. Putnam: 1958, 'The Unity of Science as a Working Hypothesis', in H. Feigl et al. (eds), Minnesota Studies in the Philosophy of Science, Vol. 2, University of Minnesota Press, Minneapolis.
32. Parsons, C.: 1970, 'On a Number-Theoretic Choice Scheme and its Relation to Induction', in A. Kino et al. (eds), Intuitionism and Proof Theory, North-Holland, Amsterdam, pp. 459-473.
33. Pohlers, W.: 1998, 'Subsystems of Set Theory and Second Order Number Theory', in Buss 1998, pp. 209-335.
34. Pour-El, M. B. and S. Kripke: 1967, 'Deduction-Preserving "Recursive Isomorphisms" between Theories', Fundamenta Mathematicae 61, 141-63.
35. Rathjen, M.: 1991, 'Proof-Theoretic Analysis of KPM', Archive for Mathematical Logic 30, 377-403.
36. Rathjen, M.: 1994, 'Proof Theory of Reflection', Annals of Pure and Applied Logic 68, 181-224.
37. Rathjen, M.: 1995, 'Recent Advances in Ordinal Analysis: ni-CA and Related Systems', Bull. Symbolic Logic 1, 468-485.
38. Rathjen, M.: 1998, 'The Superjump in Martin-Löf Type Theory', in Proceedings of the Logic Colloquium '98, Lecture Notes in Logic, 13.
39. Schütte, K.: 1960, Beweistheorie, Springer-Verlag, Berlin.
40. Schütte, K.: 1977, Proof Theory, Springer-Verlag, Berlin.
41. Setzer, A.: 1998, 'Extending Martin-Löf Type Theory by One Mahlo Universe', Preprint; to appear in Archive for Mathematical Logic.
42. Simpson, S.: 1988, 'Partial Realizations of Hilbert's Program', J. Symbolic Logic 53, 349-63.
43. Simpson, S.: 1998, Subsystems of Second Order Arithmetic, Springer-Verlag, Berlin.
44. Tait, W. W.: 1981, 'Finitism', J. Philosophy 78, 524-46.
45. Takeuti, G.: 1975, Proof Theory, North-Holland, Amsterdam.
46. Takeuti, G.: 1987, Proof Theory, 2nd. edn., North-Holland, Amsterdam.
47. Tarski, A., A. Mostowski, and R. M. Robinson: 1953, Undecidable Theories, North-Holland, Amserdam.
48. Tupailo, S.: 2000, 'Realization of Constructive Set Theory into Explicit Mathematics: A Lower Bound for Impredicative Mahlo Universe', Preprint.
49. Wang, H.: 1951, Arithmetic Translations of Axiom Systems', Transactions American Math. Soc. 71, 283-93.
50. Ye, F.: 1999, Strict Constructivism and the Philosophy of Mathematics, PhD Dissertation, Department of Philosophy, Princeton University.