scientific article; zbMATH DE number 432701

From MaRDI portal
Publication:3138828





The first part of the paper contains a streamlined proof of the result due to Girard: provably recursive functions of Peano arithmetic are exactly those bounded by the functions of the slow-growing hierarchy up to the Howard ordinal. The second part contains some of the technical details of the implementation of a program-extraction system designed by the author. It was applied to upwind the proof from the first part. For the entire collection see [Zbl 0772.00018].











This page was built for publication:

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