Pages that link to "Item:Q1267850"

The following pages link to Bounding derivation lengths with functions from the slow growing hierarchy (Q1267850):

Displayed 7 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)
• Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) ‎ (← links)
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) ‎ (← links)
• How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) ‎ (← links)
• Problems in rewriting III (Q5055847) ‎ (← links)
• The hierarchy of terminating recursive programs over N (Q6064287) ‎ (← links)