A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae

  • Paola Bruscoli
  • Alessio Guglielmi
  • Tom Gundersen
  • Michel Parigot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6355)


Jeřábek showed in 2008 that cuts in propositional-logic deep-inference 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 cut-elimination procedure.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atserias, A., Galesi, N., Pudlák, P.: Monotone simulations of non-monotone proofs. Journal of Computer and System Sciences 65(4), 626–638 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Brünnler, K.: Deep Inference and Symmetry in Classical Proofs. Logos Verlag, Berlin (2004), zbMATHGoogle Scholar
  3. 3.
    Brünnler, K.: Deep inference and its normal form of derivations. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 65–74. Springer, Heidelberg (2006), CrossRefGoogle Scholar
  4. 4.
    Brünnler, K., Tiu, A.F.: A local system for classical logic. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 347–361. Springer, Heidelberg (2001), CrossRefGoogle Scholar
  5. 5.
    Bruscoli, P., Guglielmi, A.: On the proof complexity of deep inference. ACM Transactions on Computational Logic 10(2), 1–34 (2009), Article 14, MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Buss, S.R.: The undecidability of k-provability. Annals of Pure and Applied Logic 53(1), 75–102 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Guglielmi, A.: Deep inference and the calculus of structures,
  8. 8.
    Guglielmi, A.: A system of interaction and structure. ACM Transactions on Computational Logic 8(1), 1–64 (2007), MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Guglielmi, A., Gundersen, T.: Normalisation control in deep inference via atomic flows. Logical Methods in Computer Science 4(1:9), 1–36 (2008), MathSciNetzbMATHGoogle Scholar
  10. 10.
    Jeřábek, E.: Proof complexity of the cut-free calculus of structures. Journal of Logic and Computation (2008) (in press),
  11. 11.
    Wegener, I.: The Complexity of Boolean Functions. John Wiley & Sons Ltd and B. G. Teubner, Stuttgart (1987)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Paola Bruscoli
    • 1
    • 2
  • Alessio Guglielmi
    • 1
    • 2
  • Tom Gundersen
    • 1
    • 2
  • Michel Parigot
    • 3
  1. 1.University of BathUK
  2. 2.LORIA & INRIA Nancy-Grand EstFrance
  3. 3.Laboratoire PPSUMR 7126, CNRS & Université Paris 7France

Personalised recommendations