Built-up systems of fundamental sequences and hierarchies of number-theoretic functions

DOI10.1007/BF02007256zbMath0358.02061OpenAlexW2080021443MaRDI QIDQ4133629

Diana Schmidt

Publication date: 1976

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137936

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Ordinal and cardinal numbers (03E10) Hierarchies of computability and definability (03D55)

Related Items (10)

On bimodal logics of provability ⋮ Trees, ordinals and termination ⋮ An independence result for \((\Pi^ 1_ 1-CA)+BI\) ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Deducibility and independence in Beklemishev's autonomous provability calculus ⋮ Natural well-orderings ⋮ A WALK WITH GOODSTEIN ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions” ⋮ Ackermannian Goodstein sequences of intermediate growth

Cites Work

• Systems of predicative analysis, II: Representations of ordinals
• Hierarchies of number-theoretic functions. I
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• -arithmetic and transfinite induction

This page was built for publication: Built-up systems of fundamental sequences and hierarchies of number-theoretic functions