scientific article

zbMath0541.68013MaRDI QIDQ3327710

No author found.

Publication date: 1984

Full work available at URL: https://eudml.org/doc/92207

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

term rewriting systemssimplification orderingtermination of a rewrite rule

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Simple termination is difficult ⋮ Simulation of Turing machines by a left-linear rewrite rule ⋮ Problems in rewriting III ⋮ Termination of rewriting ⋮ Simple termination is difficult

Cites Work

• Orderings for term-rewriting systems
• Proofs by induction in equational theories with constructors
• Tree acceptors and some of their applications
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: