Cut normal forms and proof complexity
- 21 March 1999
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 97 (1-3) , 127-177
- https://doi.org/10.1016/s0168-0072(98)00026-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- ON SKOLEMIZATION AND PROOF COMPLEXITYFundamenta Informaticae, 1994
- Lower bounds for increasing complexity of derivations after cut eliminationJournal of Mathematical Sciences, 1982
- Proof Theory: Some Applications of Cut-EliminationPublished by Elsevier ,1977
- Untersuchungen ber das logische Schlie en. IIMathematische Zeitschrift, 1935