{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:38:44Z","timestamp":1648870724477},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6772,"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":[[1995,1]]},"DOI":"10.1016\/0168-0072(94)00008-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:00:28Z","timestamp":1027648828000},"page":"47-67","source":"Crossref","is-referenced-by-count":5,"title":["Separations of theories in weak bounded arithmetic"],"prefix":"10.1016","volume":"71","author":[{"given":"Gaisi","family":"Takeuti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00008-Q_BIB1","series-title":"Bounded Arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/0168-0072(94)00008-Q_BIB2","series-title":"Sequential, Machine-Independent Characterizations of the Parallel Complexity Classes AlogTIME, ACk, NCk and NC, Feasible Mathematics","first-page":"49","author":"Clote","year":"1990"},{"key":"10.1016\/0168-0072(94)00008-Q_BIB3","unstructured":"P. Clote and G. Takeuti, First order bounded arithmetic and small boolean circuit complexity classes, to appear in Feasible Mathematics II."},{"key":"10.1016\/0168-0072(94)00008-Q_BIB4","series-title":"Computational Limitations of Small-Depth Circuits","author":"H\u00e5stad","year":"1987"},{"key":"10.1016\/0168-0072(94)00008-Q_BIB5","doi-asserted-by":"crossref","unstructured":"J. Kraj\u00ed\u010dek, Fragments of bounded arithmetic and bounded query classes, Trans. AMS, to appear.","DOI":"10.1090\/S0002-9947-1993-1124169-X"},{"key":"10.1016\/0168-0072(94)00008-Q_BIB6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0168-0072(91)90043-L","article-title":"Bounded arithmetic and the polynomial hierarchy","volume":"52","author":"Kraj\u00ed\u010dek","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00008-Q_BIB7","series-title":"Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400008Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400008Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T04:58:23Z","timestamp":1555304303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729400008Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["016800729400008Q"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00008-q","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}