Cut Admissibility by Saturation
Deduction modulo is a framework in which theories are integrated into proof systems such as natural deduction or sequent calculus by presenting them using rewriting rules. When only terms are rewritten, cut admissibility in those systems is equivalent to the confluence of the rewriting system, as shown by Dowek, RTA 2003, LNCS 2706. This is no longer true when considering rewriting rules involving propositions. In this paper, we show that, in the same way that it is possible to recover confluence using Knuth-Bendix completion, one can regain cut admissibility in the general case using standard saturation techniques. This work relies on a view of proposition rewriting rules as oriented clauses, like term rewriting rules can be seen as oriented equations. This also leads us to introduce an extension of deduction modulo with conditional term rewriting rules.
KeywordsInference Rule Proof System Natural Deduction Saturation Process Sequent Calculus
Unable to display preview. Download preview PDF.
- 1.Assaf, A., Burel, G.: Translating HOL to Dedukti (2013) (submitted)Google Scholar
- 2.Bachmair, L., Dershowitz, N., Plaisted, D.: Completion without failure. In: Aït-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol. 2, pp. 1–30. Academic Press Inc. (1989)Google Scholar
- 4.Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 19–99. Elsevier and MIT Press (2001)Google Scholar
- 5.Burel, G.: From axioms to rewriting rules, available on author’s web pageGoogle Scholar
- 8.Degtyarev, A., Voronkov, A.: Equality reasoning in sequent-based calculi. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 611–706. Elsevier and MIT Press (2001)Google Scholar
- 18.Jacquel, M., Berkani, K., Delahaye, D., Dubois, C.: Tableaux modulo theories using superdeduction – an application to the verification of B proof rules with the Zenon automated theorem prover. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 332–338. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 21.Vorobyov, S.G.: On the arithmetic inexpressiveness of term rewriting systems. In: LICS, pp. 212–217 (1988)Google Scholar