Term rewriting theory for the primitive recursive functions
From MaRDI portal
Recommendations
- An ordinal calculus for proving termination in term rewriting
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Predicative lexicographic path orders. An application of term rewriting to the region of primitive recursive functions
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Strictly orthogonal left linear rewrite systems and primitive recursion
Cites work
- scientific article; zbMATH DE number 432704 (Why is no real title available?)
- scientific article; zbMATH DE number 432705 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3781167 (Why is no real title available?)
- scientific article; zbMATH DE number 3557777 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 3247155 (Why is no real title available?)
- scientific article; zbMATH DE number 3320380 (Why is no real title available?)
- scientific article; zbMATH DE number 3355016 (Why is no real title available?)
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
- Bounding derivation lengths with functions from the slow growing hierarchy
- Computability. Recursive and programmable functions
- Equational derivation vs. computation
- Herbrand analyses
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- Slow growing versus fast growing
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- The realm of primitive recursion
- The slow-growing and the Graegorczyk hierarchies
- Π12-logic, Part 1: Dilators
Cited in
(19)- Invariants, patterns and weights for ordering terms
- Proving consistency of equational theories in bounded arithmetic
- On some slowly terminating term rewriting systems
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- An ordinal calculus for proving termination in term rewriting
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- Walther recursion
- Primitive recursion for higher-order abstract syntax
- scientific article; zbMATH DE number 2185713 (Why is no real title available?)
- A proof-theoretic account of primitive recursion and primitive iteration
- On the Computational Content of Termination Proofs
- 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
- scientific article; zbMATH DE number 1405625 (Why is no real title available?)
- Complexity analysis of precedence terminating infinite graph rewrite systems
- On sharing, memoization, and polynomial time
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Divergence phenomena during completion
This page was built for publication: Term rewriting theory for the primitive recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674412)
