{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:02:20Z","timestamp":1704931340530},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"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":[[2003,12]]},"DOI":"10.1016\/s0168-0072(03)00056-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:20:33Z","timestamp":1062595233000},"page":"193-231","source":"Crossref","is-referenced-by-count":8,"title":["A second-order system for polytime reasoning based on Gr\u00e4del's theorem"],"prefix":"10.1016","volume":"124","author":[{"given":"Stephen","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonina","family":"Kolokolova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0168-0072(03)00056-3_BIB1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB2","series-title":"Bounded Arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1090\/conm\/106\/1057816","article-title":"Axiomatizations and conservation results for fragments of bounded arithmetic","volume":"106","author":"Buss","year":"1990","journal-title":"Contem. Math."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0168-0072(94)00057-A","article-title":"Relating the bounded arithmetic and polynomial time hierarchies","volume":"75","author":"Buss","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB5","doi-asserted-by":"crossref","unstructured":"S.A. Cook, Feasibly constructive proofs and the propositional calculus, in: Proc. Seventh Annu. ACM Symp. on Theory of Computing, Albuquerque, NM, 1975, pp. 83\u201397.","DOI":"10.1145\/800116.803756"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB6","unstructured":"S.A. Cook, CSC 2429S: proof complexity and bounded arithmetic, course notes, 1998, URL: \u201chttp:\/\/www.cs.toronto.edu\/~sacook\/csc2429h\u201d."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/dimacs\/039\/05","article-title":"Relating the provable collapse of P to NC1 and the power of logical theories","volume":"39","author":"Cook","year":"1998","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0168-0072(03)00056-3_BIB8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","article-title":"Functional interpretations of feasibly constructive arithmetic","volume":"63","author":"Cook","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB9","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets, complexity of computation","volume":"7","author":"Fagin","year":"1974","journal-title":"SIAM-AMC Proc."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB10","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, The expressive power of second order Horn logic, in: Proc. 8th Symp. on Theoretical Aspects of Computer Science STACS \u201891, Hamburg, 1991, Lecture Notes in Computer Science, Vol. 480, Springer, Berlin, pp. 466\u2013477.","DOI":"10.1007\/BFb0020821"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(92)90149-A","article-title":"Capturing complexity classes by fragments of second order logic","volume":"101","author":"Gr\u00e4del","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB12","series-title":"Limits to Parallel Computation","author":"Greenlaw","year":"1995"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB13","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polytime","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB14","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB15","series-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"Kraji\u010dek","year":"1995"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0168-0072(91)90043-L","article-title":"Bounded arithmetic and the polynomial time hierarchy","volume":"52","author":"Kraji\u010dek","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB17","doi-asserted-by":"crossref","unstructured":"D. Leivant, Characterization of complexity classes in higher-order logic, in: Proc. Second Annu. Conf. on Structure in Complexity Theory, Ithaca, NY, 1987, pp. 203\u2013217.","DOI":"10.1109\/PSCT.1987.10319272"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0022-0000(89)90019-6","article-title":"Descriptive characterizations of computational complexity","volume":"39","author":"Leivant","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB19","series-title":"Arithmetic, Proof Theory and Computational Complexity","first-page":"247","article-title":"An equivalence between second-order bounded domain bounded arithmetic and first-order bounded arithmetic","author":"Razborov","year":"1993"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB20","series-title":"Gems of Theoretical Computer Science","author":"Sch\u00f6ning","year":"1998"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(03)00056-3_BIB22","series-title":"Arithmetic, Proof Theory and Computational Complexity","first-page":"364","article-title":"RSUV isomorphism","author":"Takeuti","year":"1993"},{"key":"10.1016\/S0168-0072(03)00056-3_BIB23","first-page":"137","article-title":"Complexity of relational query languages","volume":"68","author":"Vardi","year":"1986","journal-title":"Inform. Control"},{"issue":"3","key":"10.1016\/S0168-0072(03)00056-3_BIB24","doi-asserted-by":"crossref","first-page":"942","DOI":"10.2307\/2275794","article-title":"Notes on polynomially bounded arithmetic","volume":"61","author":"Zambella","year":"1996","journal-title":"J. Symbolic Logic"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007203000563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007203000563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T16:23:42Z","timestamp":1704903822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007203000563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0168007203000563"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(03)00056-3","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}