Hierarchies of number-theoretic functions. I

DOI10.1007/BF01967649zbMATH Open0211.31205OpenAlexW4213117200WikidataQ59409086 ScholiaQ59409086MaRDI QIDQ5612466FDOQ5612466

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

• On the interpretation of non-finitist proofs–Part II
• Title not available (Why is that?)
• Classes of recursive functions based on Ackermann's function
• Title not available (Why is that?)
• Classifications of Recursive Functions by Means of Hierarchies
• Consistency-Proof for the Generalized Continuum-Hypothesis

Cited In (23)

• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Long finite sequences
• Increase of the complexity of functions by an application of multiple recursion
• 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
• Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
• Complexity of algorithms and computations
• 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)