Pages that link to "Item:Q1200982"

The following pages link to Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982):

Displaying 25 items.

• The derivational complexity of string rewriting systems (Q441853) (← links)
• Quasi-interpretations. A way to control resources (Q541228) (← links)
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
• Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
• The Hydra battle and Cichon's principle (Q734036) (← links)
• Bounding derivation lengths with functions from the slow growing hierarchy (Q1267850) (← 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)
• Proof-theoretic analysis of termination proofs (Q1899143) (← 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)
• Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
• Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
• Reduction relations for monoid semirings (Q2643513) (← links)
• On the Computational Content of Termination Proofs (Q3195706) (← links)
• Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
• Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
• A lexicographic path order with slow growing derivation bounds (Q3619873) (← links)
• Total termination of term rewriting (Q5055796) (← links)
• Complexity Analysis by Rewriting (Q5458433) (← links)
• The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
• Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)