{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T03:40:41Z","timestamp":1777347641708,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0168-0072(91)90043-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"143-153","source":"Crossref","is-referenced-by-count":103,"title":["Bounded arithmetic and the polynomial hierarchy"],"prefix":"10.1016","volume":"52","author":[{"given":"Jan","family":"Kraj\u00ed\u010dek","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[]},{"given":"Gaisi","family":"Takeuti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90043-L_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ? NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(91)90043-L_BIB2","series-title":"Bounded Arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/0168-0072(91)90043-L_BIB3","article-title":"Axiomatizations and conservation results for fragments of bounded arithmetic,","author":"Buss","year":"1987","journal-title":"Proc. of Workshop in Logic and Computation"},{"key":"10.1016\/0168-0072(91)90043-L_BIB4","first-page":"83","article-title":"Feasibly constructive proofs and the propositional calculus","author":"Cook","year":"1975","journal-title":"Proc. 7th Ann. ACM Symp. Theory of Comput."},{"key":"10.1016\/0168-0072(91)90043-L_BIB5","series-title":"Computational Limitations of Small-Depth Circuits","author":"H\u0227stad","year":"1987"},{"key":"10.1016\/0168-0072(91)90043-L_BIB6","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th ACM Symp. Theory of Comput."},{"key":"10.1016\/0168-0072(91)90043-L_BIB7","author":"Kraj\u00ed\u010dek","year":"1988","journal-title":"\u041f1-conservativeness in systems of bounded arithmetic"},{"key":"10.1016\/0168-0072(91)90043-L_BIB8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/malq.19900360106","article-title":"Quantified propositional calculi and fragments of bounded arithmetic","volume":"36","author":"Kraj\u00ed\u010dek","year":"1989","journal-title":"Z. Math. Logik"},{"key":"10.1016\/0168-0072(91)90043-L_BIB9","series-title":"Open Days on Model Theory and Set Theory","first-page":"237","article-title":"\u03940-sets and induction","author":"Paris","year":"1984"},{"issue":"3","key":"10.1016\/0168-0072(91)90043-L_BIB10","first-page":"205","article-title":"On the scheme of induction for bounded arithmetic formulas","volume":"35","author":"Paris","year":"1987","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"10.1016\/0168-0072(91)90043-L_BIB11","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.2307\/2274618","article-title":"A note on the provability of the \u03940-PHP and the existence of infinitely many primes","volume":"53","author":"Paris","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90043-L_BIB12","article-title":"Proc. of Workshop in Logic and Computation","author":"Takeuti","year":"1987","journal-title":"Contemporary Math."},{"key":"10.1016\/0168-0072(91)90043-L_BIB13","series-title":"Proof Theory","author":"Takeuti","year":"1975"},{"key":"10.1016\/0168-0072(91)90043-L_BIB14","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"Proc. 26th Annual IEEE Symp. on Found. of Comput. Sci."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190043L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190043L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:58:44Z","timestamp":1555131524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190043L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["016800729190043L"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90043-l","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}