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.
Strong Termination for the Epsilon Substitution Method
The Journal of Symbolic Logic
Vol. 61, No. 4 (Dec., 1996), pp. 1193-1205
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2275811
Page Count: 13
You can always find the topics here!Topics: Arithmetic, R process, Numerals, Mathematical constants, Predicates, Mathematization, Mathematical logic, Induction assumption
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
Ackermann proved termination for a special order of reductions in Hilbert's epsilon substitution method for the first order arithmetic. We establish termination for arbitrary order of reductions.
The Journal of Symbolic Logic © 1996 Association for Symbolic Logic