We show, under the assumption that factoring is hard,
that a model of PV exists in which the polynomial hierarchy
does not collapse to the linear hierarchy; that a model of S21
exists in which NP is not in the second level of the linear hierarchy;
and that a model of S21 exists in which the polynomial hierarchy
collapses to the linear hierarchy.
Our methods are model-theoretic. We use the assumption about factoring to get a model in which the weak pigeonhole principle fails in a certain way, and then work with this failure to obtain our results.
As a corollary of one of the proofs, we also show that
in S21 the failure of WPHP (for Σb1 definable relations) implies that the strict version of PH
does not collapse to a finite level.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription.
Read more about accessing full-text
References
S. Buss, Bounded arithmetic, Bibliopolis, 1986.
Mathematical Reviews (MathSciNet):
MR880863
S. Cook and N. Thapen, The strength of replacement in weak arithmetic, ACM Transactions on Computational Logic, vol. 7 (2006), no. 4.
E. Jeřábek, On independence of variants of the weak pigeonhole principle, Journal of Logic and Computation, vol. 17 (2007), no. 3, pp. 587--604.
J. Krajíček, Bounded arithmetic, propositional logic, and complexity theory, Cambridge University Press, 1995.
--------, On the weak pigeonhole principle, Fundamenta Mathematicae, vol. 170 (2001), pp. 123--140.
J. Krajíček and P. Pudlák, Some consequences of cryptographical conjectures for $\text\upshape S^1_2$ and $\text\upshape EF$, Information and Computation, vol. 140 (1998), pp. 82--89.
A. Maciel, T. Pitassi, and A. R. Woods, A new proof of the weak pigeonhole principle, Journal of Computer and System Sciences, vol. 64 (2002), pp. 843--872.
J. B. Paris and A. J. Wilkie, Counting problems in bounded arithmetic, Methods in mathematical logic, Lecture Notes in Mathematics, vol. 1130, Springer--Verlag, 1985, pp. 317--340.
Mathematical Reviews (MathSciNet):
MR799046
J. B. Paris, A. J. Wilkie, and A. R. Woods, Provability of the pigeonhole principle and the existence of infinitely many primes, Journal of Symbolic Logic, vol. 53 (1988), pp. 1235--1244.
Mathematical Reviews (MathSciNet):
MR973114
C. Pollett, Multifunction algebras and the provability of $PH\downarrow$, Annals of Pure and Applied Logic, vol. 104 (2000), pp. 279--303.
J. P. Ressayre, A conservation result for systems of bounded arithmetic, unpublished manuscript, 1986.
N. Thapen, A model-theoretic characterization of the weak pigeonhole principle, Annals of Pure and Applied Logic, vol. 118 (2002), pp. 175--195.
--------, Structures interpretable in models of bounded arithmetic, Annals of Pure and Applied Logic, vol. 136 (2005), pp. 247--266.
D. Zambella, Notes on polynomially bounded arithmetic, Journal of Symbolic Logic, vol. 61 (1996), pp. 942--966.
