Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)

DOI10.1007/S001530050160zbMath0965.03070OpenAlexW1969119492MaRDI QIDQ1590659

Andreas Weiermann, Arnold Beckmann

Publication date: 26 July 2001

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050160

zbMATH Keywords

normal formtowerrandom access machinesfragment of Gödel's \(T\)Kalmar-elementary bound for termsKalmar-elementary function

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Tiering as a Recursion Technique ⋮ Inductive definitions over a predicative arithmetic

This page was built for publication: Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)