Access

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

A Feasible Theory for Analysis

Fernando Ferreira
The Journal of Symbolic Logic
Vol. 59, No. 3 (Sep., 1994), pp. 1001-1011
DOI: 10.2307/2275924
Stable URL: http://www.jstor.org/stable/2275924
Page Count: 11
  • Read Online (Free)
  • Download ($10.00)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Feasible Theory for Analysis
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
1001
    1001
  • Thumbnail: Page 
1002
    1002
  • Thumbnail: Page 
1003
    1003
  • Thumbnail: Page 
1004
    1004
  • Thumbnail: Page 
1005
    1005
  • Thumbnail: Page 
1006
    1006
  • Thumbnail: Page 
1007
    1007
  • Thumbnail: Page 
1008
    1008
  • Thumbnail: Page 
1009
    1009
  • Thumbnail: Page 
1010
    1010
  • Thumbnail: Page 
1011
    1011