A feasible theory for analysis
Keyword(s):
AbstractWe 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.
Keyword(s):
2020 ◽
Vol 171
(9)
◽
pp. 102843
◽
Keyword(s):
2017 ◽
Vol 10
(2)
◽
pp. 357-396
◽
1974 ◽
Vol 32
◽
pp. 400-401
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1987 ◽
Vol 185
◽
pp. 289-321
◽
Keyword(s):