Cut Elimination in Deduction Modulo by Abstract Completion

  • Authors:

  • Guillaume Burel;Claude Kirchner

  • Affiliations:

  • Université Henri Poincaré & LORIA, and UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP,;INRIA & LORIA, and UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP,

  • Venue:
  • LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Deduction Modulo implements Poincarés principle by identifying deduction and computation as different paradigms and making their interaction possible. This leads to logical systems like the sequent calculus or natural deduction modulo. Even if deduction modulo is logically equivalent to first-order logic, proofs in such systems are quite different and dramatically simpler with one cost: cut elimination may not hold anymore. We prove first that it is even undecidable to know, given a congruence over propositions, if cuts can be eliminated in the sequent calculus modulo this congruence.Second, to recover the cut admissibility, we show how computation rules can be added following the classical idea of completion a laKnuth and Bendix. Because in deduction modulo, rewriting acts on terms as well as on propositions, the objects are much more elaborated than for standard completion. Under appropriate hypothesis, we prove that the sequent calculus modulo is an instance of the powerful framework of abstract canonical systemsand that therefore, cuts correspond to critical proofs that abstract completion allows us to eliminate.In addition to an original and deep understanding of the interactions between deduction and computation and of the expressivity of abstract canonical systems, this provides a mechanical way to transform a sequent calculus modulo into an equivalent one admitting the cut rule, therefore extending in a significant way the applicability of mechanized proof search in deduction modulo.