<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-04-19 15:07:07Mathematics Propositional calculus Automated theorem proving Logic in computer science Frege system Cut-elimination theorem Analytic proof Sequent calculus Substitution Logic Mathematical logic Proof theory |
Add to Reading List |
ON THE PROOF COMPLEXITY OF DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI ABSTRACT. We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, 
