ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 338, Issues 1-3, 10 June 2005, Pages 200-246
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (603 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.12.019    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

A complexity analysis of functional interpretationsstar, open

Mircea-Dan Hernesta, 1, E-mail The Corresponding Author and Ulrich Kohlenbachb, Corresponding Author Contact Information, 2, E-mail The Corresponding Author

aLaboratoire D’Informatique (LIX), École Polytechnique,F-91128 Palaiseau, France bDepartment of Mathematics, Darmstadt University of Technology, Schlossgartenstrasse 7, D-64289 Darmstadt, Germany

Received 7 November 2003; 
revised 14 December 2004; 
accepted 14 December 2004. 
Communicated by D. Sannella. 
Available online 12 January 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We give a quantitative analysis of Gödel's functional interpretation and its monotone variant. The two have been used for the extraction of programs and numerical bounds as well as for conservation results. They apply both to (semi-)intuitionistic as well as (combined with negative translation) classical proofs. The proofs may be formalized in systems ranging from weak base systems to arithmetic and analysis (and numerous fragments of these). We give upper bounds in basic proof data on the depth, size, maximal type degree and maximal type arity of the extracted terms as well as on the depth of the verifying proof. In all cases terms of size linear in the size of the proof at input can be extracted and the corresponding extraction algorithms have cubic worst-time complexity. The verifying proofs have depth linear in the depth of the proof at input and the maximal size of a formula of this proof.

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


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.