{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:31:45Z","timestamp":1768563105374,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"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":[[1994,5]]},"DOI":"10.1016\/0168-0072(94)90011-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"183-212","source":"Crossref","is-referenced-by-count":33,"title":["Linear logic as a logic of computations"],"prefix":"10.1016","volume":"67","author":[{"given":"Max I.","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)90011-6_BIB1","article-title":"Computational interpretation of linear logic","author":"Abramsky","year":"1990","journal-title":"Imperial College Research Report DOC 90\/20"},{"key":"10.1016\/0168-0072(94)90011-6_BIB2","series-title":"Technical Report","article-title":"A logic for sconcurrency","author":"Asperti","year":"1987"},{"key":"10.1016\/0168-0072(94)90011-6_BIB3","first-page":"59","article-title":"Implicative formulae in the \u2018proofs as computations\u2019 analogy","author":"Asperti","year":"1990","journal-title":"Proc. 17th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0168-0072(94)90011-6_BIB4","series-title":"Technical Report","article-title":"Relating Petri nets to formulas of linear logic","author":"Brown","year":"1989"},{"key":"10.1016\/0168-0072(94)90011-6_BIB5","first-page":"175","article-title":"Axiomatizing net computations and processes","author":"Degano","year":"1989","journal-title":"Proc. 4th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90011-6_BIB6","series-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0168-0072(94)90011-6_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1990.113746","article-title":"Normal process representatives","author":"Gehlot","year":"1990","journal-title":"Proc. 5th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90011-6_BIB8","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\/0168-0072(94)90011-6_BIB9","first-page":"174","article-title":"Nets as tensor theories","author":"Gunter","year":"1989","journal-title":"Proc. 10th Internat. Conference on Application and Theory of Petri Nets"},{"key":"10.1016\/0168-0072(94)90011-6_BIB10","series-title":"Technical Report X-91-13","article-title":"The multiplicative fragment of linear logic is NP-complete","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90011-6_BIB11","series-title":"Technical Report X-91-14","article-title":"The Horn fragment of linear logic is NP-complete","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90011-6_BIB12","series-title":"Theoretical Aspects of Computer Software","first-page":"615","article-title":"Efficient program synthesis: semantics, logic, complexity","volume":"526","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90011-6_BIB13","series-title":"Technical Report CS-R9157","article-title":"Fast theorem proving in intuitionistic propositional logic","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90011-6_BIB14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/LICS.1992.185533","article-title":"Horn programming in linear logic is NP-complete","author":"Kanovich","year":"1992","journal-title":"Proc. 7th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90011-6_BIB15","series-title":"Technical Report SRI-CSL-90-08","article-title":"Decision problems for propositional linear logic","author":"Lincoln","year":"1990"},{"key":"10.1016\/0168-0072(94)90011-6_BIB16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/LICS.1991.151630","article-title":"Linearizing intuitionistic implication","author":"Lincoln","year":"1991","journal-title":"Proc. 6th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90011-6_BIB17","first-page":"313","article-title":"From Petri nets to linear logic","volume":"389","author":"Marti-Oliet","year":"1989"},{"key":"10.1016\/0168-0072(94)90011-6_BIB18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","article-title":"The complexity of the word problems for commutative semigroups and polynomial ideals","volume":"46","author":"Mayr","year":"1982","journal-title":"Adv. in Math."},{"issue":"3","key":"10.1016\/0168-0072(94)90011-6_BIB19","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0168-0072(94)90011-6_BIB20","series-title":"Research Report SRI-CSL-88-3","article-title":"Petri nets are monoids","author":"Meseguer","year":"1988"},{"issue":"3","key":"10.1016\/0168-0072(94)90011-6_BIB21","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294900116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294900116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:45:23Z","timestamp":1580899523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007294900116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0168007294900116"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)90011-6","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}