You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Classifying the Provably Total Functions of PA
The Bulletin of Symbolic Logic
Vol. 12, No. 2 (Jun., 2006), pp. 177-190
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/4617258
Page Count: 14
You can always find the topics here!Topics: Logical proofs, Cut elimination theorem, Mathematical logic, Induction assumption, Recursive functions, Proof theory, Recursion, Logical theorems, Peano axioms, Mathematical functions
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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).
The Bulletin of Symbolic Logic © 2006 Association for Symbolic Logic