Hierarchies of number-theoretic functions. I

DOI10.1007/BF01967649MaRDI QIDQ5612466zbMATH OpenOpenAlexWikidataFDO

Authors Stanley S. Wainer, Martin Löb

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

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites work

• scientific article; zbMATH DE number 3024905 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• Classes of recursive functions based on Ackermann's function
• Classifications of Recursive Functions by Means of Hierarchies
• Consistency-Proof for the Generalized Continuum-Hypothesis
• On the interpretation of non-finitist proofs–Part II

Cited in

(23)

• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Increase of the complexity of functions by an application of multiple recursion
• Long finite sequences
• Dickson's lemma and weak Ramsey theory
• The Parametric Complexity of Lossy Counter Machines
• The intrinsic difficulty of recursive functions
• Proof theory and ordinal analysis
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
• Forward analysis and model checking for trace bounded WSTS
• The strength of the SCT criterion
• Complexity of algorithms and computations
• Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
• Linearizing well quasi-orders and bounding the length of bad sequences
• Reverse mathematical bounds for the termination theorem
• Ackermannian completion of separators
• Multiply-recursive upper bounds with Higman's lemma
• The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• Relating timed and register automata
• A combinatorial bound for a restricted form of the termination theorem
• Complexity hierarchies beyond elementary
• Some rapidly growing functions
• The Ackermann functions are not optimal, but by how much?

This page was built for publication: Hierarchies of number-theoretic functions. I

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