The complexity of Boolean functions
The complexity of Boolean functions
Monotone simulations of non-monotone proofs
Journal of Computer and System Sciences - Complexity 2001
A Local System for Classical Logic
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
Proof Complexity of the Cut-free Calculus of Structures
Journal of Logic and Computation
Deep inference and its normal form of derivations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Hi-index | 0.00 |
Jeřábek showed in 2008 that cuts in propositional-logic deepinference proofs can be eliminated in quasipolynomial time. The proof is an indirect one relying on a result of Atserias, Galesi and Pudlák about monotone sequent calculus and a correspondence between this system and cut-free deep-inference proofs. In this paper we give a direct proof of Jeřábek's result: we give a quasipolynomial-time cut-elimination procedure in propositional-logic deep inference. The main new ingredient is the use of a computational trace of deep-inference proofs called atomic flows, which are both very simple (they trace only structural rules and forget logical rules) and strong enough to faithfully represent the cutelimination procedure.