{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T07:31:37Z","timestamp":1690615897237},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p>In this paper, it is proved that Girard's proof nets for multiplicative linear logic characterize free semi-star-autonomous categories.<\/jats:p>","DOI":"10.1017\/s0960129514000395","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T07:05:07Z","timestamp":1415603107000},"page":"789-828","source":"Crossref","is-referenced-by-count":1,"title":["Proof nets and semi-star-autonomous categories"],"prefix":"10.1017","volume":"26","author":[{"given":"WILLEM","family":"HEIJLTJES","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LUTZ","family":"STRA\u00dfBURGER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"S0960129514000395_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001274"},{"key":"S0960129514000395_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(95)00159-X"},{"key":"S0960129514000395_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629150.012"},{"key":"S0960129514000395_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90053-V"},{"key":"S0960129514000395_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2012.03.020"},{"key":"S0960129514000395_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"S0960129514000395_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(71)90013-2"},{"key":"S0960129514000395_ref15","volume-title":"Basic Concepts of Enriched Category Theory","author":"Kelly","year":"1982"},{"key":"S0960129514000395_ref7","volume-title":"Proof-Net Categories","author":"Do\u0161en","year":"2005"},{"key":"S0960129514000395_ref9","doi-asserted-by":"crossref","unstructured":"Heijltjes W. (2011) Proof nets for additive linear logic with units. In: Proceedings Logic in Computer Science 207\u2013216.","DOI":"10.1109\/LICS.2011.9"},{"key":"S0960129514000395_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129514000395_ref11","unstructured":"Houston R. (2008) Modelling Linear Logic without Units, Ph.D. thesis, University of Manchester."},{"key":"S0960129514000395_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(95)00160-3"},{"key":"S0960129514000395_ref20","first-page":"28","article-title":"Natural associativity and commutativity","volume":"49","author":"Mac Lane","year":"1963","journal-title":"Rice University Studies"},{"key":"S0960129514000395_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(64)90018-3"},{"key":"S0960129514000395_ref19","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(4:3)2006"},{"key":"S0960129514000395_ref10","doi-asserted-by":"crossref","unstructured":"Heijltjes W. and Houston R. (2014) No proof nets for MLL: Proof equivalence in MLL with units is PSPACE-complete. In: Proceedings of the Joint Meeting of Computer Science Logic and Logic in Computer Science (CSL-LICS) 2014. Proceedings Logic in Computer Science. To appear.","DOI":"10.1145\/2603088.2603126"},{"key":"S0960129514000395_ref18","doi-asserted-by":"crossref","unstructured":"Lamarche F. and Stra\u00dfburger L. (2005) Constructing free Boolean categories. Proceedings Logic in Computer Science, 209\u2013218.","DOI":"10.1109\/LICS.2005.13"},{"key":"S0960129514000395_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01622878"},{"key":"S0960129514000395_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060438"},{"key":"S0960129514000395_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(91)90003-P"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T01:40:31Z","timestamp":1566006031000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000395\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["S0960129514000395"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000395","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}