A characterisation of multiply recursive functions with Higman's lemma.

DOI10.1006/inco.2002.3160zbMath1053.68056OpenAlexW4246897387WikidataQ124902244 ScholiaQ124902244MaRDI QIDQ1400716

Hélène Touzet

Publication date: 2 November 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2002.3160

zbMATH Keywords

string rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Higman’s Lemma and Its Computational Content ⋮ Multiply-Recursive Upper Bounds with Higman’s Lemma

Cites Work

• Orderings for term-rewriting systems
• Ordinal recursive bounds for Higman's theorem
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterisation of multiply recursive functions with Higman's lemma.