Confluence as a Cut Elimination Property
The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system: asymmetric deduction modulo this rewrite system and that the confluence property of the rewrite system is equivalent to the cut elimination property of the associated logical system. This equivalence, however, does not extend to rewrite systems directly rewriting atomic propositions.
Unable to display preview. Download preview PDF.
- 3.M. Crabbé. Non-normalisation de ZF. Manuscript, 1974.Google Scholar
- 4.G. Dowek, Axioms vs. rewrite rules: from completeness to cut elimination. H. Kirchner and Ch. Ringeissen (Eds.) Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence 1794, Springer-Verlag, 2000, pp. 62–72.Google Scholar
- 5.G. Dowek, Th. Hardin, and C. Kirchner. Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, 1998. Journal of Automated Reasoning (to appear).Google Scholar
- 7.G. Dowek and B. Werner. An inconsistent theory modulo defined by a confluent and terminating rewrite system. Manuscript, 2000.Google Scholar
- 8.J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.Google Scholar