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

DOI10.2307/2275551zbMATH Open0882.68080OpenAlexW1517512481MaRDI QIDQ4358058FDOQ4358058

Authors: Ursula Martin Webb, E. Scott 

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

Recommendations

• The classification of polynomial orderings on monadic terms
• A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
• Total termination of term rewriting
• Extension functions for multiset orderings

zbMATH Keywords

termination orderings

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

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

Cited In (10)

• Total termination of term rewriting
• Total termination of term rewriting
• Invariants, patterns and weights for ordering terms
• The classification of polynomial orderings on monadic terms
• Leanest quasi-orderings
• A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
• Linear interpretations by counting patterns
• Relative undecidability in term rewriting. I: The termination hierarchy
• Relative undecidability in term rewriting. II: The confluence hierarchy
• Theorem proving with group presentations: examples and questions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358058)