Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-15T05:34:43.931Z Has data issue: false hasContentIssue false

A feasible theory for analysis

Published online by Cambridge University Press:  12 March 2014

Fernando Ferreira*
Affiliation:
Universidade de Lisboa, Departamento de Matemática, 1700 Lisboa, Portugal, E-mail: mferferr@ptearn.bitnet

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 -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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable