Proof-theoretic techniques for term rewriting theory.

Nachum Dershowitz*, Mitsuhiro Okada

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A bridge is presented between term-rewriting theory in computer science and proof theory in logic. It is shown that proof-theoretic tools are very useful for analyzing two basic attributes of term rewriting systems, the termination property and the Church-Rosser property. A counterexample is given to show that Knuth's critical pair lemma does not hold for conditional rewrite systems. Two restrictions on conditional systems under which the critical pair lemma holds are presented. One is considered a generalization of Bergstra-Klop's former result; the other is concerned with a generalization of Kaplan's and Jouannaud-Waldmann's systems.

Original languageEnglish
Title of host publicationProc Third Annu Symp on Logic in Comput Sci
PublisherPubl by IEEE
Pages104-111
Number of pages8
ISBN (Print)0818608536
StatePublished - 1988
Externally publishedYes

Publication series

NameProc Third Annu Symp on Logic in Comput Sci

Fingerprint

Dive into the research topics of 'Proof-theoretic techniques for term rewriting theory.'. Together they form a unique fingerprint.

Cite this