{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:06:27Z","timestamp":1766135187752},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0168-0072(99)00041-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:55:19Z","timestamp":1027612519000},"page":"155-199","source":"Crossref","is-referenced-by-count":9,"title":["A bounded arithmetic AID for Frege systems"],"prefix":"10.1016","volume":"103","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(99)00041-X_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, The complexity of the pigeonhole principle, in: Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science, 1988, pp. 346\u2013355.","DOI":"10.1109\/SFCS.1988.21951"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB2","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u0131\u0301az, J. Gabarr\u00f3, Structural Complexity II, EATCS Monographs on Theoret. Comput. Sci., Vol. 22, Springer, Berlin, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB3","doi-asserted-by":"crossref","unstructured":"M. Bonet, S. Buss, T. Pitassi, Are there hard examples for frege systems? in: P. Clote, J.B. Remmel (Eds.), Feasible Mathematics, Vol. II, Birkh\u00e4user, Boston, 1995, pp. 30\u201356.","DOI":"10.1007\/978-1-4612-2566-9_3"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB4","unstructured":"S.R. Buss, Bounded Arithmetic, Bibliopolis, Napoli, 1986."},{"key":"10.1016\/S0168-0072(99)00041-X_BIB5","doi-asserted-by":"crossref","first-page":"916","DOI":"10.2307\/2273826","article-title":"Polynomial size proofs of the propositional pigeonhole principles","volume":"52","author":"Buss","year":"1987","journal-title":"J. Symb. Logic"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB6","doi-asserted-by":"crossref","unstructured":"S.R. Buss, The Boolean formula value problem is in ALOGTIME, in: Proc. 19 Ann. ACM Symp. on Theory of Computing, May 1987, pp. 123\u2013131.","DOI":"10.1145\/28395.28409"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0168-0072(91)90036-L","article-title":"Propositional consistency proofs","volume":"52","author":"Buss","year":"1991","journal-title":"Ann. Pure. Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(92)90180-4","article-title":"The graph of multiplication is equivalent to counting","volume":"14","author":"Buss","year":"1992","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0168-0072(99)00041-X_BIB9","series-title":"Arithmetic, Proof Theory and Computational Cimplexity","first-page":"96","article-title":"Algorithms for Boolean formula evaluation and tree contraction","author":"Buss","year":"1993"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB10","series-title":"Feasible Mathematics","first-page":"49","article-title":"Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, ACk, NCk and NC","author":"Clote","year":"1990"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB11","doi-asserted-by":"crossref","unstructured":"P. Clote, ALOGTIME and a conjecture of S.A. Cook, Ann. Math. Art. Intell. 6 (1992) 57\u2013106. extended abstract in Proc. IEEE Logic in Computer Science, Philadelphia, June, 1990.","DOI":"10.1007\/BF01531023"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB12","series-title":"Arithmetic, Proof Theory and Computational Complexity","first-page":"162","article-title":"On polynomial size Frege proofs of certain combinatorial pinciples","author":"Clote","year":"1993"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0168-0072(92)90068-B","article-title":"Bounded Arithmetics for NC, ALOGTIME, L and NL","volume":"56","author":"Clote","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB14","series-title":"Feasible Mathematics II","first-page":"154","article-title":"First order bounded arithmetic and small boolean circuit complexity classes","author":"Clote","year":"1995"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB15","doi-asserted-by":"crossref","unstructured":"S.A. Cook, Feasibly constructive proofs and the propositional calculus, in: Proc. 7th Ann. ACM Symp. on Theory of Computing, 1975, pp. 83\u201397.","DOI":"10.1145\/800116.803756"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB16","first-page":"73","article-title":"Relating the provable collapse of P to NC1 and the power of logical theories","volume":"Vol. 39","author":"Cook","year":"1998"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB17","series-title":"Feasible Mathematics II","first-page":"284","article-title":"On Frege and extended Frege proof systems","author":"Kraj\u0131\u0301\u010dek","year":"1995"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB18","doi-asserted-by":"crossref","unstructured":"J. Kraj\u0131\u0301\u010dek, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge UP, Cambridge, 1995.","DOI":"10.1017\/CBO9780511529948"},{"key":"10.1016\/S0168-0072(99)00041-X_BIB19","first-page":"229","article-title":"A quantifier-free theory based on a string algebra for NC1","volume":"Vol. 39","author":"Pitt","year":"1998"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016800729900041X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016800729900041X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T22:33:04Z","timestamp":1681079584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016800729900041X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S016800729900041X"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(99)00041-x","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}