Translator Disclaimer
June 2006 Classifying the provably total functions of PA
Andreas Weiermann
Bull. Symbolic Logic 12(2): 177-190 (June 2006). DOI: 10.2178/bsl/1146620058

Abstract

We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as well as seems possible the intrinsic computational character of the standard cut elimination process. The article is intended to be suitable for teaching purposes and just requires basic familiarity with PA and the ordinals below ε₀. (Familiarity with a cut elimination theorem for a Gentzen or Tait calculus is helpful but not presupposed).

Citation

Download Citation

Andreas Weiermann. "Classifying the provably total functions of PA." Bull. Symbolic Logic 12 (2) 177 - 190, June 2006. https://doi.org/10.2178/bsl/1146620058

Information

Published: June 2006
First available in Project Euclid: 2 May 2006

zbMATH: 1118.03053
MathSciNet: MR2223920
Digital Object Identifier: 10.2178/bsl/1146620058

Rights: Copyright © 2006 Association for Symbolic Logic

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.12 • No. 2 • June 2006
Back to Top