Majorizing provably recursive functions in fragments of PA

DOI10.1007/BF02007552zbMath0592.03046MaRDI QIDQ3720596

Andrea Cantini

Publication date: 1985

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

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

zbMATH Keywords

majorizationfragments of Peano arithmeticprimitive recursive functionsfast growing hierarchy

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• Unnamed Item
• Unnamed Item
• Fragments of arithmetic
• On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION
• Iterated reflection principles and the ω-rule
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• On n-quantifier induction