### 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 language | English |
---|---|

Title of host publication | Proc Third Annu Symp on Logic in Comput Sci |

Publisher | Publ by IEEE |

Pages | 104-111 |

Number of pages | 8 |

ISBN (Print) | 0818608536 |

Publication status | Published - 1988 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proc Third Annu Symp on Logic in Comput Sci*(pp. 104-111). Publ by IEEE.

**Proof-theoretic techniques for term rewriting theory.** / Dershowitz, Nachum; Okada, Mitsuhiro.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proc Third Annu Symp on Logic in Comput Sci.*Publ by IEEE, pp. 104-111.

}

TY - GEN

T1 - Proof-theoretic techniques for term rewriting theory.

AU - Dershowitz, Nachum

AU - Okada, Mitsuhiro

PY - 1988

Y1 - 1988

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

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

UR - http://www.scopus.com/inward/record.url?scp=0024132219&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024132219&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818608536

SP - 104

EP - 111

BT - Proc Third Annu Symp on Logic in Comput Sci

PB - Publ by IEEE

ER -