{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:20:19Z","timestamp":1770297619558,"version":"3.49.0"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","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":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0304-3975(92)90386-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"1-66","source":"Crossref","is-referenced-by-count":147,"title":["Bounded linear logic: a modular approach to polynomial-time computability"],"prefix":"10.1016","volume":"97","author":[{"given":"Jean-Yves","family":"Girard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip J.","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90386-T_BIB1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, Computational interpretation of linear logic, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(93)90181-R"},{"key":"10.1016\/0304-3975(92)90386-T_BIB2","series-title":"Bounded Arithmetic","author":"Buss","year":"1986"},{"key":"10.1016\/0304-3975(92)90386-T_BIB3","series-title":"Structure in Complexity","first-page":"77","article-title":"The polynomial hierarchy and intuitionistic bounded arithmetic","volume":"Vol. 223","author":"Buss","year":"1986"},{"key":"10.1016\/0304-3975(92)90386-T_BIB4","series-title":"Feasible Mathematics","volume":"Vol. 9","year":"1990"},{"key":"10.1016\/0304-3975(92)90386-T_BIB5","series-title":"Proc. 1964 Internat. Congress for Logic, Methodology and Philosophy of Science","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/0304-3975(92)90386-T_BIB6","first-page":"83","article-title":"Feasibly constructive proofs and the propositional calculus","author":"Cook","year":"1975","journal-title":"Proc. 7th Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90386-T_BIB7","doi-asserted-by":"crossref","unstructured":"S.A. Cook and B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: [4], pp. 71\u201396.","DOI":"10.1109\/SFCS.1989.63471"},{"key":"10.1016\/0304-3975(92)90386-T_BIB8","series-title":"Tech. Report 210\/88","article-title":"Functional interpretations of feasibly constructive arithmetic","author":"Cook","year":"1988"},{"key":"10.1016\/0304-3975(92)90386-T_BIB9","first-page":"107","author":"Cook","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(92)90386-T_BIB10","series-title":"Combinatorial Functors","author":"Crossley","year":"1974"},{"key":"10.1016\/0304-3975(92)90386-T_BIB11","article-title":"La logique lin\u00e9aire appliqu\u00e9e \u00e0 l'\u00e9tude de divers processus de normalisation et principalement du \u03bb-calcul","volume":"VII","author":"Danos","year":"1990","journal-title":"Th\u00e8se de doctorat, Universit\u00e9 Paris"},{"key":"10.1016\/0304-3975(92)90386-T_BIB12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01622878","article-title":"The structure of multiplicatives","volume":"28","author":"Danos","year":"1989","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/0304-3975(92)90386-T_BIB13","series-title":"Proc. 2nd Scandinavian Logic Symposium","first-page":"63","article-title":"Une extension de l'interpr\u00e9tation de G\u00f6del a l'analyse, et son application a l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types","author":"Girard","year":"1971"},{"key":"10.1016\/0304-3975(92)90386-T_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90386-T_BIB15","first-page":"11","article-title":"Multiplicatives","author":"Girard","year":"1987","journal-title":"Rend. Sem. Mat. Univ. Politec. Torino"},{"issue":"No. 19","key":"10.1016\/0304-3975(92)90386-T_BIB16","article-title":"Quantifiers in linear logic II","author":"Girard","year":"1991","journal-title":"Pr\u00e9publications Paris 7 Logique"},{"key":"10.1016\/0304-3975(92)90386-T_BIB17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0003-4843(81)90016-4","article-title":"\u03a012-logic","volume":"21","author":"Girard","year":"1981","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(92)90386-T_BIB18","first-page":"69","article-title":"Towards a geometry of interaction","volume":"Vol. 92","author":"Girard","year":"1989"},{"key":"10.1016\/0304-3975(92)90386-T_BIB19","series-title":"Logic Colloquium '88","first-page":"221","article-title":"Geometry of interaction I: Interpretation of system F","author":"Girard","year":"1989"},{"key":"10.1016\/0304-3975(92)90386-T_BIB20","series-title":"COLOG-88","first-page":"76","article-title":"Geometry of interaction 2: Deadlock-free algorithms","volume":"Vol. 417","author":"Girard","year":"1990"},{"key":"10.1016\/0304-3975(92)90386-T_BIB21","article-title":"Proofs and Types","volume":"Vol. 7","author":"Girard","year":"1989"},{"key":"10.1016\/0304-3975(92)90386-T_BIB22","unstructured":"J-Y. Girard, A. Scedrov, and P.J. Scott, Bounded linear logic: a modular approach to polynomial time computability (Extended Abstract), in: [4], p"},{"key":"10.1016\/0304-3975(92)90386-T_BIB23","series-title":"Computation and Proof Theory","first-page":"175","article-title":"Toward logic tailored for computational complexity","volume":"Vol. 1104","author":"Gurevich","year":"1984"},{"key":"10.1016\/0304-3975(92)90386-T_BIB24","series-title":"Current Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1988"},{"key":"10.1016\/0304-3975(92)90386-T_BIB25","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90386-T_BIB26","first-page":"61","article-title":"On the expressive power of Datalog: tools and a case study","author":"Kolaitis","year":"1990","journal-title":"Proc. 9th ACM Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(92)90386-T_BIB27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01792986","article-title":"Op\u00e9rateurs de mise en m\u00e9moire et traduction de G\u00f6del","volume":"30","author":"Krivine","year":"1990","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/0304-3975(92)90386-T_BIB28","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/LICS.1989.39192","article-title":"Polynomially graded logic I: a graded version of system T","author":"Nerode","year":"1989","journal-title":"Fourth IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90386-T_BIB29","article-title":"Subrecursion","volume":"Vol. 9","author":"Rose","year":"1984"},{"key":"10.1016\/0304-3975(92)90386-T_BIB30","first-page":"154","article-title":"A brief guide to linear logic","volume":"41","author":"Scedrov","year":"1990","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0304-3975(92)90386-T_BIB31","series-title":"Computability","author":"Tourlakis","year":"1984"},{"key":"10.1016\/0304-3975(92)90386-T_BIB32","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90386-T_BIB33","series-title":"Computational Complexity","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290386T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290386T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:57:49Z","timestamp":1555113469000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290386T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030439759290386T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90386-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}