On the recursive decomposition ordering with lexicographical status and other related orderings
From MaRDI portal
Publication:912609
DOI10.1007/BF00302640zbMath0698.68031MaRDI QIDQ912609
Publication date: 1990
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
68Q65: Abstract data types; algebraic specification
06A99: Ordered sets
03D03: Thue and Post systems, etc.
Related Items
Topics in termination, Natural termination, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Simplification orderings: Putting them to the test, Proving termination of (conditional) rewrite systems. A semantic approach, Practical algorithms for deciding path ordering constraint satisfaction., A path ordering for proving termination of AC rewrite systems, An improved general path order, Jumping and escaping: modular termination and the abstract path ordering
Uses Software
Cites Work