The following pages link to (Q5297489):
Displaying 9 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Bounding derivation lengths with functions from the slow growing hierarchy (Q1267850) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- On some slowly terminating term rewriting systems (Q3466405) (← links)
- (Q5009706) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)
