Termination proofs by multiset path orderings imply primitive recursive derivation lengths

Theoretical Computer Science

Volumn 105, Issue 1, 1992, Pages 129-140

  Hofbauer, Dieter ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PATH ANALYSIS; FORMAL LOGIC; LOGIC PROGRAMMING; RECURSIVE FUNCTIONS; THEOREM PROVING;

GRZEGORCZYK HIERARCHY; MULTISET PATH ORDERINGS; PRIMITIVE RECURSIVE DERIVATION LENGTHS; TERM REWRITING SYSTEM; TERMINATION PROOF;

AUTOMATA THEORY;

EID: 0026940707     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90289-R     Document Type: Article

References (20)

1. Bounds on derivation lengths from termination proofs
2. Orderings for term rewriting systems
3. Termination of rewriting
4. Rewrite systems
5. Proof-theoretic techniques for term rewriting theory
6. Canonical conditional rewrite systems
7. Termination relative
8. Termination proofs and the length of derivations
9. Recursive decomposition ordering
10. A path ordering for proving termination of term rewriting systems
11. Term rewriting systems: a tutorial
12. Canonical algebraic simplifications in computational logic
13. On proving term rewriting systems are Noetherian
14. Horn logic and rewriting for functional and logic program design
15. A recursively defined ordering for proving termination of term rewriting systems
16. Path of subterms ordering and recursive decomposition ordering revisited
17. Extensions and comparison of simplification orderings