Majorizing provably recursive functions in fragments of PA

DOI10.1007/BF02007552zbMATH Open0592.03046MaRDI QIDQ3720596FDOQ3720596

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

Recommendations

• Provably recursive functions in fragments of Peano arithmetic
• scientific article; zbMATH DE number 4039893
• scientific article; zbMATH DE number 1215495
• A modified sentence unprovable in PA
• scientific article; zbMATH DE number 4033742

zbMATH Keywords

majorizationfragments of Peano arithmeticprimitive recursive functionsfast growing hierarchy

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• Title not available (Why is that?)
• Fragments of arithmetic
• On n-quantifier induction
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Iterated reflection principles and the ω-rule
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Title not available (Why is that?)
• On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION

Cited In (10)

• Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts
• Fragments of arithmetic and pairing functions
• Subrecursive degrees and fragments of Peano arithmetic
• On Grzegorczyk induction
• Pa-Beweisbare ∀∃-Formeln
• Title not available (Why is that?)
• A slow growing analogue to Buchholz' proof
• Provably recursive functions in fragments of Peano arithmetic
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Majorizing provably recursive functions in fragments of PA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720596)