{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:26:56Z","timestamp":1779398816536,"version":"3.53.1"},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":5390,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1994,6]]},"abstract":"<jats:p>We have found both a proofnet criterion and a sequent calculus for the multiplicative fragment with units ( \u22971,\u2118,0, <jats:italic>atoms<\/jats:italic>), but without the \u2534-boxes of Girard (1987), which differentiate between 1 and \u2534. We have also proved that for any of our proofnets there is a corresponding sequential proof.<\/jats:p>","DOI":"10.1017\/s0960129500000451","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T09:01:15Z","timestamp":1236157275000},"page":"273-285","source":"Crossref","is-referenced-by-count":31,"title":["The mix rule"],"prefix":"10.1017","volume":"4","author":[{"given":"Arnaud","family":"Fleury","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Retor\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500000451_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129500000451_ref002","unstructured":"Danos V. (1990) La Logique Lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers Processus de Normalisation et principalement du \u03bb-calcul, PhD thesis, Universit\u00e9 Paris 7, Math\u00e9matiques."},{"key":"S0960129500000451_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90181-R"},{"key":"S0960129500000451_ref008","unstructured":"Retor\u00e9 C (1993c) Pomset Logic: a truly concurrent linear calculus, Rapport INRIA, March 1994."},{"key":"S0960129500000451_ref005","unstructured":"Lincoln P and Winkler T. (1992) Constant-Only Multiplicative Linear Logic is NP-complete. Theoretical Computer Science (to appear)."},{"key":"S0960129500000451_ref006","volume-title":"Graph theory from linear logic: Aggregates","author":"Retor\u00e9","year":"1993"},{"key":"S0960129500000451_ref003","article-title":"The Structure of Multiplicatives","volume":"28","author":"Danos","year":"1990","journal-title":"Archive for Mathematical Logic"},{"key":"S0960129500000451_ref009","volume-title":"Lectures on Linear Logic","author":"Troelstra","year":"1992"},{"key":"S0960129500000451_ref007","unstructured":"Retor\u00e9 C (1993b) R\u00e9seaux et S\u00e9quents Ordonn\u00e9s, PhD thesis, Universit\u00e9 Paris 7, Math\u00e9matiques."}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500000451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T03:49:32Z","timestamp":1557892172000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500000451\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["S0960129500000451"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500000451","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}