Hierarchies of number-theoretic functions. I
From MaRDI portal
Publication:5612466
DOI10.1007/BF01967649zbMath0211.31205OpenAlexW4213117200WikidataQ59409086 ScholiaQ59409086MaRDI QIDQ5612466
Publication date: 1970
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137832
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (23)
Zeno, Hercules, and the Hydra ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Reverse mathematical bounds for the termination theorem ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ The intrinsic difficulty of recursive functions ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Some rapidly growing functions ⋮ Complexity of algorithms and computations ⋮ Relating timed and register automata ⋮ Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy ⋮ The Strength of the SCT Criterion ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Dickson's lemma and weak Ramsey theory ⋮ Multiply-Recursive Upper Bounds with Higman’s Lemma ⋮ Built-up systems of fundamental sequences and hierarchies of number-theoretic functions ⋮ Long finite sequences ⋮ The Ackermann functions are not optimal, but by how much? ⋮ Proof theory and ordinal analysis ⋮ Increase of the complexity of functions by an application of multiple recursion ⋮ Linearizing well quasi-orders and bounding the length of bad sequences ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary
Cites Work
This page was built for publication: Hierarchies of number-theoretic functions. I
