Hierarchies of number-theoretic functions II
From MaRDI portal
Publication:5626637
DOI10.1007/BF01973616zbMath0222.02049OpenAlexW2020050887WikidataQ59409089 ScholiaQ59409089MaRDI QIDQ5626637
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/137838
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (10)
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Undecidable complexity statements in -arithmetic ⋮ Hyperations, Veblen progressions and transfinite iteration of ordinal functions ⋮ Complexity of algorithms and computations ⋮ Parameter free induction and provably total computable functions ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ The Ackermann functions are not optimal, but by how much? ⋮ Increase of the complexity of functions by an application of multiple recursion ⋮ The slow-growing and the Graegorczyk hierarchies ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
This page was built for publication: Hierarchies of number-theoretic functions II
