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, - Frege system - Document - PDFSEARCH.IO

First Page	Meta Content
	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, Add to Reading List Document Date: 2009-04-19 15:07:07 Open Document File Size: 331,31 KB Share Result on Facebook IndustryTerm modal logic systems / analytic deepinference proof systems / analytic deep-inference proof systems / Analytic systems / polynomial-time computable algorithm / proof systems / deep-inference systems / deep-inference proof systems / / Person ALESSIO GUGLIELMI / PAOLA BRUSCOLI / Ai / / ProvinceOrState Kansas / / Technology polynomial-time computable algorithm / same algorithm / / URL http / SocialTag Mathematics Propositional calculus Automated theorem proving Logic in computer science Frege system Cut-elimination theorem Analytic proof Sequent calculus Substitution Logic

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, Add to Reading List