scientific article; zbMATH DE number 5172485
From MaRDI portal
Publication:5297489
zbMath1113.68419MaRDI QIDQ5297489
Publication date: 18 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grammars and rewriting systems (68Q42) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20)
Related Items (8)
On some slowly terminating term rewriting systems ⋮ On the Computational Content of Termination Proofs ⋮ A characterisation of multiply recursive functions with Higman's lemma. ⋮ An upper bound on the derivational complexity of Knuth-Bendix orderings. ⋮ Unnamed Item ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Derivation lengths and order types of Knuth--Bendix orders ⋮ The Hydra battle and Cichon's principle
This page was built for publication:
