Pages that link to "Item:Q1200982"
From MaRDI portal
The following pages link to Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982):
Displayed 13 items.
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Reduction relations for monoid semirings (Q2643513) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)