Confluence as a Cut Elimination Property-Reference-Cited by-同舟云学术

Confluence as a Cut Elimination Property

Published:2003 Issue: Volume: Page:2-13
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Dowek Gilles

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44881-0_2

Reference9 articles.

1. L. Bachmair and N. Dershowitz, Equational Inference, Canonical Proofs, and Proof Orderings. Journal of the ACM 41(2), 1994, pp. 236–276

2. A. Church and J.B. Rosser, Some properties of conversion. Transactions of the American Mathematical Society, 39, 1936, pp. 472–482.

3. M. Crabbé. Non-normalisation de ZF. Manuscript, 1974.

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.

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).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice;Journal of Automated Reasoning;2019-09-23

2. A Completion Method to Decide Reachability in Rewrite Systems;Frontiers of Combining Systems;2015

3. Cut Admissibility by Saturation;Lecture Notes in Computer Science;2014

4. Canonical Ground Horn Theories;Programming Logics;2013

5. Some General Results About Proof Normalization;Logica Universalis;2010-02-11