Total termination of term rewriting
From MaRDI portal
(Redirected from Publication:5055796)
Total termination of term rewriting (scientific article; zbMATH DE number 7631210)
Total termination of term rewriting (scientific article; zbMATH DE number 7631210)
Recommendations
Cites work
- Extensions and comparison of simplification orderings
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- Proving termination with multiset orderings
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination of term rewriting by interpretation
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- The order types of termination orderings on monadic terms, strings and multisets
Cited in
(15)- Termination of term rewriting: Interpretation and type elimination
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
- Total termination of term rewriting is undecidable
- Total termination of term rewriting
- scientific article; zbMATH DE number 408817 (Why is no real title available?)
- scientific article; zbMATH DE number 1761896 (Why is no real title available?)
- Extension orderings
- Towards a domain theory for termination proofs
- Problems in rewriting III
- Dummy elimination: Making termination easier
- Simple termination revisited
- Computer Science Logic
- An ordinal calculus for proving termination in term rewriting
- Termination of term rewriting by interpretation
- Termination proofs for ground rewrite systems -- interpretations and derivational complexity
This page was built for publication: Total termination of term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055796)
