Advertisement

Confluence as a Cut Elimination Property

  • Gilles Dowek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2706)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Bachmair and N. Dershowitz, Equational Inference, Canonical Proofs, and Proof Orderings. Journal of the ACM 41(2), 1994, pp. 236–276zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    A. Church and J.B. Rosser, Some properties of conversion. Transactions of the American Mathematical Society, 39, 1936, pp. 472–482.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    M. Crabbé. Non-normalisation de ZF. Manuscript, 1974.Google Scholar
  4. 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. 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
  6. 6.
    G. Dowek and B. Werner. Proof normalization modulo. In Types for proofs and programs 98, Lecture Notes in Computer Science 1657, Springer-Verlag, 1999, pp. 62–77.CrossRefGoogle Scholar
  7. 7.
    G. Dowek and B. Werner. An inconsistent theory modulo defined by a confluent and terminating rewrite system. Manuscript, 2000.Google Scholar
  8. 8.
    J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.Google Scholar
  9. 9.
    M.H.A. Newman, On theories with a combinatorial definition of “equivalence”. Annals of Mathematics, 43,2, 1942, pp. 223–243.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gilles Dowek
    • 1
  1. 1.École polytechnique and INRIALIX, École polytechniquePalaiseau CedexFrance

Personalised recommendations