Reduction of finite and infinite derivations

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 167-188

  Mints, G ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Analysis; Cut elimination; First order arithmetic; Normalization

Indexed keywords

EID: 0346438625     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00011-7     Document Type: Article

References (25)

1. H. Barendregt, The Lambda Calculus, North-Holland, Amsterdam, 1981.
2. W. Buchholz, Notation systems for infinitary derivations, Arch. Math. Logic 30 (5-6) (1991) 277-296.
3. W. Buchholz, Explaining Gentzen's consistency proof within infinitary proof theory, in: G. Gottlob, A. Leitsch, D. Mundici (Eds.), Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Lecture Notes in Computer Science, Vol. 1289, Springer, Berlin, 1997.
4. W. Buchholz, Explaining consistency proofs within infinitary proof theory II, to appear in Archive for Mathematical Logic.
5. R. Gandy, An early proof of normalization by A.M. Turing, in: J.P. Seldin, J.R. Hindley (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 453-455.
6. G. Gentzen, Untersucuhgen über das logische Schliessen, Math. Z. 39 (1934) 176-210, 405-431.
7. G. Gentzen, Die Widerspruchsfreiheit der reinen Zahlentheorie, Math. Ann. 112 (1936) 493-565.
8. G. Gentzen, Neue Fassung des Widerspruchsfreiheitsbeweises fuer die reine Zahlentheorie, Forsch. zur Logik u.z. Grundl. d. exacten Wiss., Hf.4, Leipzig, Hirzel, pp. 19-44.
9. W. Howard, The formulae-as-types notion of construction, in: J.P. Seldin, J.R. Hindley (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 479-490.
10. S.C. Kleene, Introduction to Metamathematics, North-Holland, Amsterdam, 1952.
11. G. Kreisel, A survey of proof theory I, J. Symbolic Logic 33 (3) (1968) 321-388.
12. G. Kreisel, A survey of proof theory II, Proc. 2nd Scand. Logic Symp., North-Holland, Amsterdam, 1972, pp. 109-170.
13. G. Mints, Normalization of Finite Terms and Derivations via Infinite ones, 1974, reprinted in [17], pp. 73-76.
14. G. Mints, Finite investigations of transfinite derivations, J. Soviet Math. 10 (1978) 548-596, reprinted in [17], pp. 17-72.
15. G. Mints, A new reduction sequence for arithmetic, J. Soviet Math. 20 (1982) 2322-2333, reprinted in [17], pp. 77-96.
16. G. Mints, A normal form theorem for logical derivations implying one for arithmetic derivations, Ann. Pure and Appl. Logic 62 (1993) 65-79.
17. G. Mints, Selected Papers in Proof Theory, North-Holland and Bibliopolis, Amsterdam and Naples, 1992.
18. D. Prawitz, Ideas and results in proof theory, Proc. 2nd Scand. Logic Symp., North-Holland, Amsterdam, 1972, pp. 235-308.
19. M. Rathjen, Proof-theoretic analysis of KPM, Arch. Math. Logic 30 (N5/6) (1991) 377-404.
20. K. Schütte, Proof Theory, Springer, Berlin, 1977.
21. J. Barwise (ed.), Schwichtenberg Cutelimination, The Handbook of Mathematical Logic, North-Holland, Amsterdam 1977.
22. W. Tait, Intensional interpretations of functionals of finite types, I, J. Symbolic Logic 32 (1967) 198-212.
23. G. Takeuti, Proof Theory, 2nd ed., North-Holland, Amsterdam, 1988.
24. A. Troelstra, D. van Dalen, Constructivism in Mathematics, An Introduction, Vol. 2, North-Holland, Amsterdam, 1988.
25. S. Tupailo, Finitary reductions for local predicativity, Ph.D. Thesis, Stanford, 1998.