{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:45Z","timestamp":1753889685810,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The multiplicative fragment of Linear Logic is the formal system in this\nfamily with the best understood proof theory, and the categorical models which\nbest capture this theory are the fully complete ones. We demonstrate how the\nHyland-Tan double glueing construction produces such categories, either with or\nwithout units, when applied to any of a large family of degenerate models. This\nprocess explains as special cases a number of such models from the literature.\nIn order to achieve this result, we develop a tensor calculus for compact\nclosed categories with finite biproducts. We show how the combinatorial\nproperties required for a fully complete model are obtained by this glueing\nconstruction adding to the structure already available from the original\ncategory.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:6)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":0,"title":["Constructing Fully Complete Models of Multiplicative Linear Logic"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"given":"Andrea","family":"Schalk","sequence":"first","affiliation":[]},{"given":"Hugh Paul","family":"Steele","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"1112:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1582\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1582\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:05Z","timestamp":1681243625000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:6)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1505.06056","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1505.06056","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,9,3]]},"article-number":"1582"}}