|
Zapiski Nauchnykh Seminarov POMI, 2003, Volume 304, Pages 99–120
(Mi znsl879)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
$S_{k,\exp}$ does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ uniformly
Ch. Pollett Department of Computer Science San Jose State University
Abstract:
A notion of a uniform sequent calculus proof is given. It is then shown that a strengthening, $S_{k,\exp}$, of the well-studied bounded arithmetic system $S_k$ of Buss does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ with a uniform proof. A slightly stronger result that $S_{k,\exp}$ cannot prove $\widehat\Sigma_{1,k'}^b=\widehat\Pi_{1,k'}^b$ uniformly for $2\leq k'\leq k$ is
also established. A variation on the technique used is then applied to show that $S_{k,\exp}$ is unable to prove
Davis–Putnam–Robinson–Matiyasevich theorem. This result is also without any uniformity conditions.
Generalization of both these results to higher levels of the Grzegorczyck Hierarchy are then presented.
Received: 03.05.2003
Citation:
Ch. Pollett, “$S_{k,\exp}$ does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ uniformly”, Computational complexity theory. Part VIII, Zap. Nauchn. Sem. POMI, 304, POMI, St. Petersburg, 2003, 99–120; J. Math. Sci. (N. Y.), 130:2 (2005), 4607–4619
Linking options:
https://www.mathnet.ru/eng/znsl879 https://www.mathnet.ru/eng/znsl/v304/p99
|
Statistics & downloads: |
Abstract page: | 169 | Full-text PDF : | 40 | References: | 52 |
|