Cut Admissibility by Saturation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
lncs.pdf (372.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01097428 , version 1 (19-12-2014)



Guillaume Burel. Cut Admissibility by Saturation. Joint International Conference, RTA-TLCA 2014, Jul 2014, Vienna, Austria. pp.124-138, ⟨10.1007/978-3-319-08918-8_9⟩. ⟨hal-01097428⟩
94 View
155 Download



Gmail Facebook X LinkedIn More