scientific article; zbMATH DE number 1405625

MaRDI QIDQ4938604zbMATH OpenFDO

Authors H. Touzet

Publication date 5 July 2000

zbMATH Keywords

order typestring rewriting systemsHardy hierarchyderivation lengthexpressiveness of Higman's lemmamultiply recursive functions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• A characterisation of multiply recursive functions with Higman's lemma.
• Multiply-recursive upper bounds with Higman's lemma
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
• Ordinal recursive bounds for Higman's theorem
• Term rewriting theory for the primitive recursive functions

Cited in

(3)

• A characterisation of multiply recursive functions with Higman's lemma.
• An upper bound on the derivational complexity of Knuth-Bendix orderings.
• Multiply-recursive upper bounds with Higman's lemma

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 Q4938604)