Corrigendum to ``Termination of rewriting

DOI10.1016/S0747-7171(87)80017-2zbMath0637.68036OpenAlexW4212785096MaRDI QIDQ1098625

Nachum Dershowitz

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80017-2

zbMATH Keywords

term rewritingrewrite rulesordering on termstermination proofs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65)

Related Items (7)

Open problems in rewriting ⋮ A complete characterization of termination of 0p 1q→1r 0s ⋮ Rewrite systems for integer arithmetic ⋮ Programming in metric temporal logic ⋮ Overlap closures do not suffice for termination of general term rewriting systems ⋮ Rewrite, rewrite, rewrite, rewrite, rewrite, \dots ⋮ Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm

Cites Work

• Orderings for term-rewriting systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Corrigendum to ``Termination of rewriting