Extracting Herbrand disjunctions by functional interpretation

Archive for Mathematical Logic

Volumn 44, Issue 5, 2005, Pages 633-644

  Gerhardy, Philipp ^a,b   Kohlenbach, Ulrich ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Functional interpretation; Herbrand's theorem

Indexed keywords

EID: 21544481173     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00153-005-0275-1     Document Type: Article

References (26)

1. Beckmann, A.: Exact bounds for lengths of reductions in typed λ-calculus. J. Symbolic Logic 66, 1277-1285 (2001)
2. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed lambda-calculus. In: R. Vemuri (ed.), Proceedings of the 6. Annual IEEE Symposium on Logic in Computer Sciences(LICS), IEEE Press Los Alamitos, Los Alamitos, 1991, pp. 203-211
3. Buss, S.R.: An Introduction to Proof Theory. In: S.R. Buss (ed.), Handbook of Proof Theory, Elsevier Science B.V., 1998, pp. 2-78
4. Diller, J.: Logical problems of functional interpretations. Annals of Pure and Applied Logic 114, 27-42 (2002)
5. Diller, J., Nahm, W.: Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik Endlicher Typen. Arch. Math. Logik 16, 49-66 (1974)
6. Gerhardy, P.: Improved Complexity Analysis of Cut Elimination and Herbrand's Theorem. Master's thesis, Aarhus, 2003
7. Gerhardy, P.: Refined Complexity Analysis of Cut Elimination. In: M. Baaz, J. Makovsky, Proceedings of the 17th International Workshop CSL 2003, Volume 2803 of LNCS, Springer-Verlag, Berlin, 2003, pp. 212-225
8. Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica, 12, 280-287 (1958)
9. Hernest, M.-D.: A comparison between two techniques of program extraction from classical proofs. In: M. Baaz, J. Makobsky, A. Voronkov (eds.), LPAR 2002: Short Contributions and CSL 2003: Extended Posters, volume VIII Kurt Gödel Society's Collegium Logicum, Springer-Verlag, Berlin, 2004, pp. 99-102
10. Hernest, M.-D., Kohlenbach, U.: A Complexity Analysis of Functional Interpretations. To appear in: Theoretical Computer Science
11. Kohlenbach, U.: A note on Spector's quantifier-free rule of extensionality. Arch. Math. Logic 40, 89-92 (2001)
12. Kreisel, G.: Review of [20]. in Mathematical Reviews 1967. 37 #1224
13. 2-formulas. In: J. Stern (eds.), Logic Colloquium '81, North-Holland Publishing Company, 1982, pp. 39-55
14. Luckhardt, H.: Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlsschranken. J. Symbolic Logic 54, 234-263 (1989)
15. Orevkov, V.P.: Lower bounds on the increase in complexity of deductions in cut elimination. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov 88, 137-162 (1979);
16. English transl. J. Soviet Math. 20 (4), 1982
17. Orevkov, V.P.: Complexity of Proofs and Their Transformations in Axiomatic Theories, volume 128 of Translations of Mathematical Monographs. AMS Providence R.I., 1993
18. Pudlak, P.: The Length of Proofs. In: S.R. Buss (ed.), Handbook of Proof Theory, Elsevier Science B.V., 1998, pp. 548-637
19. Schwichtenberg, H.: Complexity of normalization in the pure typed lambda-calculus. In: A. Troelstra, D. van Dalen, The L.E.J. Brouwer Centenary Symposium, North-Holland Publishing Company, 1982, pp. 453-457
20. Schwichtenberg, H.: An upper bound for reduction sequences in the typed λ-calculus. Arch. Math. Logic 30, 405-408 (1991)
21. Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading, Mass., 1967
22. Spector, C.: Provably recursive functionals of analysis : a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. In: J. Dekker (ed.), Proceedings of Symposia in Pure Mathematics, Vol 5, AMS, Providence, R.I., 1962, pp. 1-27
23. Statman, R.: Lower Bounds on Herbrand's Theorem. Proc. Am. Math. Soc.75, 104-107 (1979)
24. Troelstra, A.S. (ed.): Metamathematical investigation of intuitionistic arithmetic and analysis, volume 344 of Springer LNM. Springer-Verlag, Berlin, 1973
25. Zhang, W.: Cut elimination and automatic proof procedures. Theoretical Computer Science 91, 265-284 (1991)
26. Zhang, W.: Depth of proofs, depth of cut-formulas and complexity of cut formulas. Theoretical Computer Science 129, 193-206 (1994)