Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- 6 March 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 139 (1-2) , 355-362
- https://doi.org/10.1016/0304-3975(94)00135-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Uniform Approach to Fundamental Sequences and HierarchiesMathematical Logic Quarterly, 1994
- Termination proofs by multiset path orderings imply primitive recursive derivation lengthsTheoretical Computer Science, 1992
- Slow growing versus fast growingThe Journal of Symbolic Logic, 1989
- Eine Klassifikation der ε0‐Rekursiven FunktionenMathematical Logic Quarterly, 1971