Theoretical Computer Science
Cut elimination and automatic proof procedures
Theoretical Computer Science
Depth of proofs, depth of cut-formulas and complexity of cut formulas
Theoretical Computer Science
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Proofnets and Context Semantics for the Additives
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
About Translations of Classical Logic into Polarized Linear Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Characterizing strong normalization in a language with control operators
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Confluence as a cut elimination property
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
| Hi-index | 5.23 |
The importance of the structure of cut-formulas with respect to proof length and proof depth has been studied in various occasions. It has been illustrated that a quantifier may be more powerful than a binary connective in cut-formulas with respect to the reduction (or increase) of proof length and proof depth, and a sequence of quantifiers of the same type (existential or universal) may be less powerful than a sequence of quantifiers of alternating types. This paper provides a refined view on cut-elimination through an analysis of the structure of proofs, brings new insight into the relation between cut-formulas and short proofs, and illustrates that a mixture of quantifiers and binary connectives could be important for achieving the maximal benefit of cut-formulas for obtaining short proofs.