Bounded arithmetic and the polynomial hierarchy
- 15 April 1991
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 52 (1-2) , 143-153
- https://doi.org/10.1016/0168-0072(91)90043-l
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Quantified propositional calculi and fragments of bounded arithmeticMathematical Logic Quarterly, 1990
- Provability of the pigeonhole principle and the existence of infinitely many primesThe Journal of Symbolic Logic, 1988
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975