{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:24Z","timestamp":1772242044583,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We prove coherence theorems for Frobenius pseudomonoids and snakeorators in monoidal bicategories. As a consequence we obtain a 3d notation for proofs in nonsymmetric multiplicative linear logic, with a geometrical notion of equivalence, and without the need for a global correctness criterion or thinning links. We argue that traditional proof nets are the 2d projections of these 3d diagrams.<\/jats:p>","DOI":"10.23638\/lmcs-15(3:5)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:38:30Z","timestamp":1743687510000},"source":"Crossref","is-referenced-by-count":0,"title":["Coherence for Frobenius pseudomonoids and the geometry of linear proofs"],"prefix":"10.23638","volume":"Volume 15, Issue 3","author":[{"given":"Lawrence","family":"Dunn","sequence":"first","affiliation":[]},{"given":"Jamie","family":"Vicary","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,7,26]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1601.05372v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1601.05372v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:38:31Z","timestamp":1743687511000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(3:5)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1601.05372v4","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1601.05372","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1601.05372","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.340.11","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"article-number":"4674"}}