{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:18:47Z","timestamp":1778037527887,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0168-0072(92)90068-b","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T16:46:26Z","timestamp":1034354786000},"page":"73-117","source":"Crossref","is-referenced-by-count":33,"title":["Bounded arithmetic for NC, ALogTIME, L and NL"],"prefix":"10.1016","volume":"56","author":[{"given":"P.","family":"Clote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Takeuti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0168-0072(92)90068-B_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90057-S","article-title":"Arithmetizing uniform NC","volume":"53","author":"Allen","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(92)90068-B_BIB2","series-title":"Introduction to Design and Analysis","article-title":"Computer Algorithms","author":"Baase","year":"1988"},{"key":"10.1016\/0168-0072(92)90068-B_BIB3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(92)90068-B_BIB4","series-title":"Stud. in Proof Theory","article-title":"Bounded Arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/0168-0072(92)90068-B_BIB5","series-title":"Tech. Report BCCS-88-07","article-title":"A sequential programming language for parallel complexity classes","author":"Clote","year":"1988"},{"key":"10.1016\/0168-0072(92)90068-B_BIB6","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\/0168-0072(92)90068-B_BIB7","first-page":"125","article-title":"Exponential time and bounded arithmetic","volume":"221","author":"Clote","year":"1986"},{"key":"10.1016\/0168-0072(92)90068-B_BIB8","first-page":"24","article-title":"The intrinsic computational difficulty of functions","volume":"II","author":"Cobham","year":"1965"},{"key":"10.1016\/0168-0072(92)90068-B_BIB9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0168-0072(92)90068-B_BIB10","series-title":"Tech. Report 210\/88","article-title":"Functional interpretations of feasibly constructive arithmetic","author":"Cook","year":"1988"},{"key":"10.1016\/0168-0072(92)90068-B_BIB11","article-title":"Proof Theory and Logical Complexity","volume":"Vol. 1","author":"Girard","year":"1987"},{"key":"10.1016\/0168-0072(92)90068-B_BIB12","series-title":"Tech. Report 114","article-title":"Synchronous parallel computation","author":"Goldschlager","year":"1977"},{"issue":"4","key":"10.1016\/0168-0072(92)90068-B_BIB13","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immermann","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(92)90068-B_BIB14","doi-asserted-by":"crossref","unstructured":"R. Kaye, Parameter-free induction schemas, J. Symbolic Logic, to appear.","DOI":"10.2307\/2274606"},{"key":"10.1016\/0168-0072(92)90068-B_BIB15","series-title":"Project Mac Technical Memorandum 52","article-title":"Computing in logarithmic space","author":"Lind","year":"1974"},{"key":"10.1016\/0168-0072(92)90068-B_BIB16","article-title":"Parallel algorithms for some computational problems","volume":"26","author":"Moitra","year":"1987"},{"key":"10.1016\/0168-0072(92)90068-B_BIB17","article-title":"Subrecursion-functions and hierarchies","volume":"9","author":"Rose","year":"1986"},{"key":"10.1016\/0168-0072(92)90068-B_BIB18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0168-0072(92)90068-B_BIB19","series-title":"Stud. Logic Found. Math.","article-title":"Proof Theory","author":"Takeuti","year":"1987"},{"key":"10.1016\/0168-0072(92)90068-B_BIB20","first-page":"281","article-title":"Sharply bounded arithmetic and the function a \u2238 1","volume":"106","author":"Takeuti","year":"1990"},{"key":"10.1016\/0168-0072(92)90068-B_BIB21","author":"Wilkie","year":"1985","journal-title":"Personal communication"},{"key":"10.1016\/0168-0072(92)90068-B_BIB22","first-page":"307","article-title":"Proc. 20th IEEE Symp. on the foundations of Computer Science","year":"1979","journal-title":"On simultaneous resource bounds"},{"key":"10.1016\/0168-0072(92)90068-B_BIB23","first-page":"1","year":"1983","journal-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729290068B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729290068B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T11:22:05Z","timestamp":1554981725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729290068B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["016800729290068B"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(92)90068-b","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}