Subrecursive degrees and fragments of Peano arithmetic
From MaRDI portal
Publication:5945568
DOI10.1007/s001530000066zbMath0982.03022MaRDI QIDQ5945568
Publication date: 19 March 2002
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
extensions of elementary arithmeticfirst-order theoriesprovably total computable functionsubrecursive degree structure
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (4)
Provability algebras and proof-theoretic ordinals. I ⋮ Streamlined subrecursive degree theory ⋮ Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ Honest elementary degrees and degrees of relative provability without the cupping property
This page was built for publication: Subrecursive degrees and fragments of Peano arithmetic
