Termination of rewrite systems by elementary interpretations

DOI10.1007/BF01214624zbMath0817.68095MaRDI QIDQ1805401

Pierre Lescanne

Publication date: 11 May 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

terminationrewrite systemswell-foundednesstotal connection

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

More problems in rewriting, Mechanically proving termination using polynomial interpretations, Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations, Automatic Proofs of Termination With Elementary Interpretations

Uses Software

• LARCH
• ORME
• REVE

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Termination by completion
• Termination orderings for associative-commutative rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item