Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
From MaRDI portal
(Redirected from Publication:673975)
Recommendations
Cites work
- scientific article; zbMATH DE number 432704 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 4033739 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A Uniform Approach to Fundamental Sequences and Hierarchies
- Bounding derivation lengths with functions from the slow growing hierarchy
- Eine Klassifikation der ε0‐Rekursiven Funktionen
- Incremental termination proofs and the length of derivations
- Slow growing versus fast growing
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Cited in
(35)- A lexicographic path order with slow growing derivation bounds
- Bounding derivation lengths with functions from the slow growing hierarchy
- Termination proofs and the length of derivations
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Proving consistency of equational theories in bounded arithmetic
- Quasi-interpretations. A way to control resources
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- The Derivational Complexity Induced by the Dependency Pair Method
- scientific article; zbMATH DE number 2090079 (Why is no real title available?)
- Complexity Analysis by Rewriting
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- KBO orientability
- Rewriting Techniques and Applications
- Applications and extensions of context-sensitive rewriting
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- The hierarchy of terminating recursive programs over N
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Some interesting connections between the slow growing hierarchy and the Ackermann function
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
- Formalizing termination proofs under polynomial quasi-interpretations
- The Hydra battle and Cichon's principle
- On the Computational Content of Termination Proofs
- Derivation lengths and order types of Knuth--Bendix orders
- Strictly orthogonal left linear rewrite systems and primitive recursion
- Predicative lexicographic path orders. An application of term rewriting to the region of primitive recursive functions
- Proof-theoretic analysis of termination proofs
- Automated Complexity Analysis Based on the Dependency Pair Method
- scientific article; zbMATH DE number 1405625 (Why is no real title available?)
- Incremental termination proofs and the length of derivations
- Derivational complexity and context-sensitive Rewriting
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- Term rewriting theory for the primitive recursive functions
This page was built for publication: Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673975)
