The order types of termination orderings on monadic terms, strings and multisets

DOI10.2307/2275551zbMath0882.68080OpenAlexW1517512481MaRDI QIDQ4358058

Elizabeth A. Scott, Ursula Martin Webb

Publication date: 28 September 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275551

zbMATH Keywords

termination orderings

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (7)

Total termination of term rewriting ⋮ Leanest quasi-orderings ⋮ Theorem proving with group presentations: Examples and questions ⋮ Total termination of term rewriting ⋮ Invariants, patterns and weights for ordering terms ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Verifying nilpotence
• Orderings for term-rewriting systems
• Automating the Knuth Bendix ordering
• Termination of rewriting
• A geometrical approach to multiset orderings
• Termination of term rewriting: Interpretation and type elimination
• Total termination of term rewriting
• Proving termination with multiset orderings

This page was built for publication: The order types of termination orderings on monadic terms, strings and multisets