Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability, complexity, logic. Transl. from the German / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138831 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orderings for term-rewriting systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Termination of rewriting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819993 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Termination proofs and the length of derivations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3683533 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3817590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path of subterms ordering and recursive decomposition ordering revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extensions and comparison of simplification orderings / rank | |||
Normal rank |
Latest revision as of 12:07, 17 May 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