No label defined (Q4934570)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1390283
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1390283

      Statements

      0 references
      27 September 2000
      0 references
      subrecursive hierarchy
      0 references
      number-theoretic functions
      0 references
      pointwise hierarchy
      0 references
      slow growing
      0 references
      fast growing
      0 references
      growing rate of functions
      0 references
      unprovability results for PA
      0 references
      A subrecursive hierarchy \((P_{\alpha})_{\alpha<\varepsilon_0}\) of unary number-theoretic functions is called slow growing if each \(P_{\alpha}\) is dominated by a Kalmar elementary recursive function. The pointwise hierarchy \((P_{\alpha})_{\alpha<\varepsilon_0}\) is recursively defined: \(P_0(x)=0\); \(P_{\alpha+1}(x)=1+P_{\alpha}(x)\); \(P_{\lambda}(x)=P_{\lambda[x]}(x)\) where \(\lambda\) is a limit and \((\lambda[x])_{x<\omega}\) is a distinguished fundamental sequence for \(\lambda\). This paper tries to classify as far as possible those natural assignments of fundamental sequences for which the induced pointwise hierarchy remains slow growing or becomes fast growing in the sense that the resulting hierarchy matches up with the Schwichtenberg-Wainer hierarchy \((F_{\alpha})_{\alpha<\varepsilon_0}\). Then the growing rate of functions which are defined pointwise with respect to a norm function are investigated. Finally, some of the obtained results are reformulated in terms of unprovability results for PA; Friedman's result stating that PA does not prove that \(\varepsilon_0\) is slowly well-ordered is re-obtained. For the entire collection see [Zbl 0919.00040].
      0 references

      Identifiers