Refined complexity analysis of cut elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2803, Issue , 2003, Pages 212-225

  Gerhardy, Philipp ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY ANALYSIS; CUT ELIMINATION; LOWER BOUNDS; REFINED ANALYSIS; UPPER AND LOWER BOUNDS; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 26944483792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_19     Document Type: Article

References (17)

1. Zhang, W.: Cut elimination and automatic proof procedures. Theoretical Computer Science 91 (1991) 265-284
2. Zhang, W.: Depth of proofs, depth of cut-formulas and complexity of cut formulas. Theoretical Computer Science 129 (1994) 193-206
3. Schwichtenberg, H.: Proof Theory: Some Applications of Cut-Elimination. In Barwise, J., ed.: Handbook of Mathematical Logic. North-Holland Publishing Company (1977) 868-894
4. Buss, S.R.: An Introduction to Proof Theory. In Buss, S.R., ed.: Handbook of Proof Theory. Elsevier Science B.V. (1998) 2-78
5. Luckhardt, H.: Komplexität der Beweistransformation bei Schnittelimination. Handwritten notes (1991)
6. Kohlenbach, U.: Notes to [5]. Handwritten notes (1995)
7. Girard, J.Y.: Linear logic. Theoretical Computer Science 50 (1987) 1-102
8. Blass, A.: A game semantics for linear logic. Annals of Pure and Applied Logic 56 (1992) 183-220
9. Ketonen, J., Weyrauch, R.: A Decidable Fragment of Predicate Calculus. Theoretical Computer Science 32 (1984) 297-307
10. Bellin, G., Ketonen, J.: A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation. Theoretical Computer Science 95 (1992) 115-142
11. Statman, R.: Lower Bounds on Herbrand's Theorem. Proc. of the Amer. Math. Soc. 75 (1979) 104-107
12. Orevkov, V.P.: Complexity of Proofs and Their Transformations in Axiomatic Theories. Volume 128 of Translations of Mathematical Monographs. American Mathematical Society, Providence, Rhode Island (1993)
13. Pudlak, P.: The Length of Proofs. In Buss, S.R., ed.: Handbook of Proof Theory. Elsevier Science B.V. (1998) 548-637
14. Baaz, M., Leitsch, A.: On Skolemizations and Proof Complexity. Fundamenta Informatica 20/4 (1994) 353-379
15. Gerhardy, P.: Improved Complexity Analysis of Cut Elimination and Herbrand's Theorem. Master's thesis (2003)
16. Carbone, A.: Asymptotic Cyclic Expansion and Bridge Groups of Formal Proofs. Journal of Algebra 242 (2001) 109-145
17. Baaz, M., Leitsch, A.: Cut Normal Forms and Proof Complexity. Annals of Pure and Applied Logic 97 (1999) 127-177