A complexity analysis of functional interpretations

Theoretical Computer Science

Volumn 338, Issue 1-3, 2005, Pages 200-246

  Hernest, Mircea Dan ^a   Kohlenbach, Ulrich ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Combinatorial logic; Computational complexity; Functional interpretation; Functionals of finite type; Program extraction from (classical) proofs; Proof complexity; Proof mining; Proof carrying code; Software and systems verification

Indexed keywords

BOUNDARY CONDITIONS; CHARACTERIZATION; COMBINATORIAL MATHEMATICS; COMPUTER SOFTWARE; FORMAL LOGIC; THEOREM PROVING;

BASE SYSTEMS; FUNCTIONAL INTERPRETATIONS; FUNCTIONALS OF FINITE TYPE; PROGRAM EXTRACTION; PROOF COMPLEXITY; PROOF MINING; PROOF-CARRYING CODE;

COMPUTATIONAL COMPLEXITY;

EID: 18544381384     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.019     Document Type: Article

References (56)

1. W. Alexi Extraction and verification of programs by analysis of formal proofs Theoret. Comput. Sci. 61 1988 225 258
2. J. Avigad Formalizing forcing arguments in subsystems of second-order arithmetic Ann. Pure Appl. Logic 82 1996 165 191
3. J. Avigad, and S. Feferman Gödel's functional ('Dialectica') interpretation Handbook of Mathematical Logic, Studies in Logic and the Foundations of Mathematics Vol. 90 1977 North-Holland Amsterdam, New York, Oxford 337 405
4. J. Barwise (Ed.), Handbook of Mathematical Logic, Studies in Logic and the Foundations of Mathematics, Vol. 90, North-Holland, Amsterdam, New York, Oxford, 1977.
5. U. Berger, W. Buchholz, and H. Schwichtenberg Refined program extraction from classical proofs Ann. Pure Appl. Logic 114 2002 3 25
6. W. Burr Functional interpretation of Aczel's constructive set theory Ann Pure Appl. Logic 104 2000 31 75
7. S.R. Buss (Ed.), Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics, Vol. 137, Elsevier, Amsterdam, 1998.
8. S. Cook, and A. Urquhart Functional interpretations of feasibly constructive arithmetic Ann. Pure Appl. Logic 63 1993 103 200
9. T. Coquand, and M. Hofmann A new method for establishing conservativity of classical systems over their intuitionistic version Math. Struct. Comput. Sci. 9 4 1999 323 333
10. J. Diller, and W. Nahm Eine Variante zur Dialectica Interpretation der Heyting Arithmetik endlicher Typen Arch. Mathem. Logik und Grundl. 16 1974 49 66
11. A.G. Dragalin New kinds of realisability and the Markov rule Dokl. Akad. Nauk. SSSR 251 1980 534 537 (in Russian, the English Translation is [12])
12. A.G. Dragalin New kinds of realisability and the Markov rule Soviet Math. Dokl. 21 1980 461 464
13. S. Feferman Theories of finite type related to mathematical practice Handbook of Mathematical Logic Studies in Logic and the Foundations of Mathematics Vol. 90 1977 North-Holland Amsterdam, New York, Oxford 913 972
14. H. Friedman Systems of second order arithmetic with restricted induction, I, II (abstracts) J. Symbolic Logic 41 1976 557 559
15. H. Friedman, Classical and intuitionistically provably recursive functions, in: G.H. Müller, D.S. Scott (Eds.), Higher Set Theory, Lecture Notes in Mathematics, Vol. 669, Springer, Berlin, 1978, pp. 21-27.
16. P. Gerhardy, The Role of quantifier alternations in Cut Elimination, Notre Dame Journal of Formal Logic, to appear.
17. P. Gerhardy, Improved complexity analysis of cut elimination and Herbrand's theorem, Master's Thesis, University of Aarhus, Department of Computer Science, 2003.
18. P. Gerhardy, Refined complexity analysis of cut elimination, in: Matthias Baaz, Johann Makovsky (Eds.), Proc. 17th Internat. Workshop CSL 2003, Vol. 2803, Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 212-225.
19. P. Gerhardy, U. Kohlenbach, Extracting Herbrand disjunctions by functional interpretation, Arch. Math. Logic, to appear.
20. J.-Y. Girard, Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérior, Ph.D. Thesis, Université de Paris VII, 1972.
21. K. Gödel Zur intuitionistischen Arithmetik und Zahlentheorie Ergebnisse eines Mathematischen Kolloquiums 4 1933 34 38
22. K. Gödel Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes Dialectica 12 1958 280 287
23. P. Hájek, Interpretability and fragments of arithmetic, in: Arithmetic, proof theory, and computational complexity (Prague, 1991), Oxford Logic Guides, Vol. 23, Oxford University Press, New York, 1993, pp. 185-196.
24. S. Hayashi, and H. Nakano PX A Computational Logic 1988 MIT Press Cambridge, MA
25. M.-D. Hernest A comparison between two techniques of program extraction from classical proofs M. Baaz J. Makovsky A. Voronkov LPAR 2002: Short Contributions and CSL 2003 Extended Posters, Kurt Gödel Society's Collegium Logicum Vol. VIII 2004 Springer Berlin 99 102
26. M.-D. Hernest, U. Kohlenbach, A complexity analysis of functional interpretations, Technical Report BRICS RS-03-12, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, February 2003.
27. W.A. Howard, Hereditarily majorizable functionals of finite type, Metamathematical investigation of intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, Vol. 344, Springer, Berlin, Heidelberg, New York, 1973, pp. 454-461.
28. K.F. Jørgensen, Finite type arithmetic, Master's Thesis, University of Roskilde, Departments of Mathematics and Philosophy, 2001.
29. U. Kohlenbach, Proof interpretations and the computational content of proofs, Lecture Course, latest version in the author's web page.
30. U. Kohlenbach Effective bounds from ineffective proofs in analysis an application of functional interpretation and majorization J. Symbolic Logic 57 4 1992 1239 1273
31. U. Kohlenbach Analysing proofs in analysis W. Hodges M. Hyland C. Steinhorn J. Truss Logic From Foundations to Applications, Keele, 1993, European Logic Colloquium 1996 Oxford University Press Oxford 225 260
32. U. Kohlenbach Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals Arch. Math. Logic 36 1996 31 71
33. U. Kohlenbach On the no-counterexample interpretation J. Symbolic Logic 64 1999 1491 1511
34. U. Kohlenbach A note on Spector's quantifier-free rule of extensionality Arch. Math. Logic 40 2001 89 92
35. U. Kohlenbach, and P. Oliva Proof mining a systematic way of analysing proofs in mathematics Proc. Steklov Institute of Mathematics Vol. 242 2003 136 164
36. G. Kreisel On the interpretation of non-finitist proofs, part I J. Symbolic Logic 16 1951 241 267
37. G. Kreisel On the interpretation of non-finitist proofs, part II Interpretation of number theory J. Symbolic Logic 17 1952 43 58
38. G. Kreisel On weak completeness of intuitionistic predicate logic J. Symbolic Logic 27 1962 139 158
39. H. Luckhardt, Extensional Gödel Functional Interpretation, Lecture Notes in Mathematics, Vol. 306, Springer, Berlin, 1973.
40. C. Murthy, Extracting constructive content from classical proofs, Ph.D. Thesis, Cornell University, 1990.
41. V.P. Orevkov Lower bounds on the increase in complexity of deductions after cut elimination Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 88 1979 137 162
42. V.P. Orevkov Complexity of proofs and their transformations in axiomatic theories D. Louvish Translations of Mathematical Monographs Vol. 128 1993 American Mathematical Society Providence, RI, USA
43. C. Parsons On n -quantifier induction J. Symbolic Logic 37 1972 466 482
44. P. Pudlak The lengths of proofs Studies in Logic and the Foundations of Mathematics Vol. 137 1998 Elsevier Amsterdam 547 637
45. P. Rath, Eine verallgemeinerte Funktionalinterpretation der Heyting Arithmetik endlicher Typen., Ph.D. Thesis, Universität Münster, 1978.
46. M. Schönfinkel Über die Bausteine der mathematischen Logik Mathematische Annalen 92 1924 305 316
47. H. Schwichtenberg, An arithmetic for polynomial-time computation, Theorèt. Comput. Sci., to be published, Available in the author's web page.
48. H. Schwichtenberg, and S. Bellantoni Feasible computation with higher types H. Schwichtenberg R. Steinbrüggen Proof and System-Reliability, Proc. NATO Advanced Study Institute, Marktoberdorf, 2001 2002 Kluwer Academic Publisher Dordrecht 399 415
49. H. Schwichtenberg and Others, Proof- and program-extraction system MINLOG, Free code and documentation at http://www.minlog-system.de.
50. S.G. Simpson Subsystems of second order arithmetic Perspectives in Mathematical Logic 1999 Springer Berlin
51. C.Spector, Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, in: J.C.E. Dekker (Ed.), Recursive Function Theory, Symposia in Pure Mathematics, Vol. 5, Amer. Math. Soc. Providence RI. 1962, pp. 1-27.
52. R. Statman Lower bounds on Herbrand's theorem Proc. Amer. Math. Soc. 75 1 1979 104 107
53. M. Stein, Interpretation der heyting-arithmetik endlicher typen, Ph.D. Thesis, Universität Münster, 1976.
54. A.S. Troelstra, Realisability. In: Buss, S. (Ed.), Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics, Vol. 137, Elsevier, Amsterdam, 1998, pp. 407-473.
55. A.S. Troelstra (Ed.), Metamathematical investigation of intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, Vol. 344, Springer, Berlin, Heidelberg, New York, 1973.
56. A.S. Troelstra, H. Schwichtenberg, Basic proof theory, Cambridge Tracts in Theoretical Computer Science, Second ed., Vol. 43, Cambridge University Press, Cambridge, 1973.