Ordinal recursive bounds for Higman's theorem

DOI10.1016/S0304-3975(97)00009-1zbMATH Open0902.68100OpenAlexW2014322000MaRDI QIDQ1129003FDOQ1129003

Authors: E. A. Cichon, E. Tahhan-Bittar 

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00009-1

Recommendations

• Multiply-recursive upper bounds with Higman's lemma
• A characterisation of multiply recursive functions with Higman's lemma.
• Publication:4938604
• scientific article; zbMATH DE number 2085177
• Complexity bounds for some finite forms of Kruskal's theorem

zbMATH Keywords

Higman's theoremHardy hierarchies

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• A classification of the ordinal recursive functions
• Accessible Independence Results for Peano Arithmetic
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• Title not available (Why is that?)
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Π12-logic, Part 1: Dilators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Title not available (Why is that?)
• Ordinal complexity of recursive definitions
• An ordinal calculus for proving termination in term rewriting

Cited In (10)

• Higman's lemma and its computational content
• Nondeterministic ordered restarting automata
• A characterisation of multiply recursive functions with Higman's lemma.
• The Parametric Complexity of Lossy Counter Machines
• An upper bound on the derivational complexity of Knuth-Bendix orderings.
• Linearizing well quasi-orders and bounding the length of bad sequences
• Multiply-recursive upper bounds with Higman's lemma
• Complexity of controlled bad sequences over finite sets of \(\mathbb{N}^d\)
• Title not available (Why is that?)
• Complexity hierarchies beyond elementary

This page was built for publication: Ordinal recursive bounds for Higman's theorem

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