The following pages link to Slow growing versus fast growing (Q3478403):
Displaying 6 items.
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Equational derivation vs. computation (Q1338198) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
