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.
Extensions of Arithmetic For Proving Termination of Computations
Clement F. Kent and Bernard R. Hodgson
The Journal of Symbolic Logic
Vol. 54, No. 3 (Sep., 1989), pp. 779-794
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2274742
Page Count: 16
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
Kirby and Paris have exhibited combinatorial algorithms whose computations always terminate, but for which termination is not provable in elementary arithmetic. However, termination of these computations can be proved by adding an axiom first introduced by Goodstein in 1944. Our purpose is to investigate this axiom of Goodstein, and some of its variants, and to show that these are potentially adequate to prove termination of computations of a wide class of algorithms. We prove that many variations of Goodstein's axiom are equivalent, over elementary arithmetic, and contrast these results with those recently obtained for Kruskal's theorem.
The Journal of Symbolic Logic © 1989 Association for Symbolic Logic