Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:58, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Termination proofs by multiset path orderings imply primitive recursive derivation lengths |
scientific article |
Statements
Termination proofs by multiset path orderings imply primitive recursive derivation lengths (English)
0 references
16 January 1993
0 references
It is shown that a termination proof for a term rewriting system using multiset path orderings (i.e. recursive path orderings with multiset status only) yields a primitive recursive bound on the length of derivations, measured in the size of the starting term, confirming a conjecture of \textit{D. Plaisted} [A recursively defined ordering for proving termination of term rewriting systems, Report UIUCDCS-R-78-943, University of Illinois, Urbana, IL (1978)]. The result is essentially optimal as such derivation lengths can be found in each level of the Grzegorczyk hierarchy, even for string rewriting systems.
0 references
termination
0 references
term rewriting system
0 references
multiset path orderings
0 references