On the recursive decomposition ordering with lexicographical status and other related orderings

DOI10.1007/BF00302640zbMath0698.68031MaRDI QIDQ912609

Pierre Lescanne

Publication date: 1990

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

terminationterm rewriting systemswell-foundedness

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Ordered sets (06A99) Thue and Post systems, etc. (03D03)

Related Items

A path ordering for proving termination of AC rewrite systems ⋮ Topics in termination ⋮ An improved general path order ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Practical algorithms for deciding path ordering constraint satisfaction. ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Natural termination ⋮ Simplification orderings: Putting them to the test ⋮ Proving termination of (conditional) rewrite systems. A semantic approach

Uses Software

• RRL
• REVE

Cites Work

• Orderings for term-rewriting systems
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• On folk theorems
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item