Pages that link to "Item:Q674412"
From MaRDI portal
The following pages link to Term rewriting theory for the primitive recursive functions (Q674412):
Displaying 14 items.
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion (Q1827398) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- (Q3024905) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- On some slowly terminating term rewriting systems (Q3466405) (← 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)
- Divergence phenomena during completion (Q5055775) (← links)
- A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration (Q5195245) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
- Primitive recursion for higher-order abstract syntax (Q5958752) (← links)
