scientific article

zbMath0518.68025MaRDI QIDQ3667939

Pierre Lescanne

Publication date: 1982

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

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

zbMATH Keywords

terminationterm rewriting systemsrecursive path orderingequational theoriesdecomposition orderingleft-weighted termsrecursive lexicographic ordering

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Termination of rewriting, Path of subterms ordering and recursive decomposition ordering revisited, An effective proof of the well-foundedness of the multiset path ordering, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Unnamed Item, Proof of termination of the rewriting system SUBSET on CCL, Termination orderings for associative-commutative rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Proofs by induction in equational theories with constructors
• A note on simplification orderings
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• On multiset orderings
• Abstract Data Type Specification in the Affirm System
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture