scientific article; zbMATH DE number 2043536

MaRDI QIDQ4447240zbMATH OpenFDO

Authors Georg Moser, Andreas Weiermann

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060296.htm

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20) Grammars and rewriting systems (68Q42)

Recommendations

• Bounding derivation lengths with functions from the slow growing hierarchy
• scientific article; zbMATH DE number 4016888
• scientific article; zbMATH DE number 6307926
• Some interesting connections between the slow growing hierarchy and the Ackermann function
• A lexicographic path order with slow growing derivation bounds
• From hierarchical to relative hyperbolicity
• On the dependence of the growth rate on the length of the defining relator
• scientific article; zbMATH DE number 2152691
• Publication:3200545
• Bottom-Up derivatives of tree expressions

Cited in

(8)

• Bounding derivation lengths with functions from the slow growing hierarchy
• Equational derivation vs. computation
• Proof-theoretic analysis of termination proofs
• Multiply-recursive upper bounds with Higman's lemma
• On the Computational Content of Termination Proofs
• Strictly orthogonal left linear rewrite systems and primitive recursion
• Well partial orders
• The Hydra battle and Cichon's principle

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447240)