Cut normal forms and proof complexity

Annals of Pure and Applied Logic

Volumn 97, Issue 1-3, 1999, Pages 127-177

  Baaz, Matthias ^a   Leitsch, Alexander ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Cut elimination; Normal forms; Proof complexity

Indexed keywords

EID: 0033590740     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00026-8     Document Type: Article

References (9)

1. M. Baaz, C. Fermüller, A. Leitsch, A non-elementary speed-up in proof length by structural clause form transformation, Proc. 9th LICS Symposium, IEEE Computer Science Press, Paris, 1994, pp. 213-219.
2. M. Baaz, A. Leitsch, On skolemization and proof complexity, Fund. Informat. 20 (4) (1994) 353-379.
3. M. Baaz, A. Leitsch, Fast cut-elimination by projection, Proc. CSL'96, Lecture Notes in Computer Science, Vol. 1258, Springer, Berlin, 1997, pp. 18-33.
4. G. Gentzen, Untersuchungen über das logische Schließen, Mathematische Zeitschrift 39 (1934-1935) 405-431.
5. J.Y. Girard, Proof Theory and Logical Complexity, in Studies in Proof Theory, Bibliopolis, Napoli, 1987.
6. V.P. Orevkov, Lower bounds for increasing complexity of derivations after cut elimination (translation), J. Sov. Math. (1982) 2337-2350.
7. H. Schwichtenberg, Proof theory: Some applications of cut-elimination, in: J. Barwise (Ed.), Handbook of Mathematical Logic, 5th printing, North-Holland, Amsterdam, 1989.
8. R. Statman, Lower bounds on Herbrand's theorem, Proc. of the Amer. Math. Soc., Vol. 75, 1979, pp. 104-107.
9. G. Takeuti, Proof Theory, 2nd Ed., North-Holland, Amsterdam, 1987.