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.
A Feasible Theory for Analysis
The Journal of Symbolic Logic
Vol. 59, No. 3 (Sep., 1994), pp. 1001-1011
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2275924
Page Count: 11
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 construct a weak second-order theory of arithmetic which includes Weak König's Lemma (WKL) for trees defined by bounded formulae. The provably total functions (with Σb1-graphs) of this theory are the polynomial time computable functions. It is shown that the first-order strength of this version of WKL is exactly that of the scheme of collection for bounded formulae.
The Journal of Symbolic Logic © 1994 Association for Symbolic Logic