Majorizing provably recursive functions in fragments of PA
From MaRDI portal
(Redirected from Publication:3720596)
Recommendations
Cites work
- scientific article; zbMATH DE number 3531352 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- Eine Klassifikation der ε0‐Rekursiven Funktionen
- Fragments of arithmetic
- Iterated reflection principles and the ω-rule
- On n-quantifier induction
- On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
Cited in
(11)- 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
- scientific article; zbMATH DE number 733384 (Why is no real title available?)
- A slow growing analogue to Buchholz' proof
- A uniform characterization of \(\Sigma_1\)-reflection over the fragments of Peano arithmetic
- Provably recursive functions in fragments of Peano arithmetic
- scientific article; zbMATH DE number 440480 (Why is no real title available?)
- scientific article; zbMATH DE number 4039893 (Why is no real title available?)
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)
