Pages that link to "Item:Q673975"
From MaRDI portal
The following pages link to Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975):
Displaying 21 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- KBO orientability (Q846165) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← 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)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results (Q2566073) (← links)
- Some interesting connections between the slow growing hierarchy and the Ackermann function (Q2747706) (← 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)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- Proving consistency of equational theories in bounded arithmetic (Q4532615) (← links)
- (Q5014441) (← links)
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)