If you need an accessible version of this item please contact JSTOR User Support

Classifying the Provably Total Functions of PA

Andreas Weiermann
The Bulletin of Symbolic Logic
Vol. 12, No. 2 (Jun., 2006), pp. 177-190
Stable URL: http://www.jstor.org/stable/4617258
Page Count: 14
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Classifying the Provably Total Functions of PA
Preview not available

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 ε0. (Familiarity with a cut elimination theorem for a Gentzen or Tait calculus is helpful but not presupposed).

Page Thumbnails

  • Thumbnail: Page 
177
    177
  • Thumbnail: Page 
178
    178
  • Thumbnail: Page 
179
    179
  • Thumbnail: Page 
180
    180
  • Thumbnail: Page 
181
    181
  • Thumbnail: Page 
182
    182
  • Thumbnail: Page 
183
    183
  • Thumbnail: Page 
184
    184
  • Thumbnail: Page 
185
    185
  • Thumbnail: Page 
186
    186
  • Thumbnail: Page 
187
    187
  • Thumbnail: Page 
188
    188
  • Thumbnail: Page 
189
    189
  • Thumbnail: Page 
190
    190