Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference11 articles.
1. Factorization of polynomials and Σ10 induction
2. Descriptive and computational complexity
3. Buss S. , Bounded arithmetic, Ph.D. Dissertation, Princeton University, Princeton, New Jersey, 1985, rev. version, Bibliopolis, Naples, 1986.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献