{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:49:00Z","timestamp":1725594540915},"publisher-location":"Vienna","reference-count":5,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211829714"},{"type":"electronic","value":"9783709165102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/978-3-7091-6510-2_7","type":"book-chapter","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T11:31:40Z","timestamp":1309779100000},"page":"106-114","source":"Crossref","is-referenced-by-count":0,"title":["Linear Logic"],"prefix":"10.1007","author":[{"given":"Jules","family":"Desharnais","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Hodgson","sequence":"additional","affiliation":[]},{"given":"John","family":"Mullins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"All three authors acknowledge the financial support of the NSERC (Natural Sciences and Engineering Research Council) of Canada."},{"key":"7_CR2","unstructured":"From [Girard 1995]: \u201cThe most traditional, and also the less interesting semantics of linear logic associates values to formulas, in the spirit of classical model theory. Therefore it only modelizes provability, and not proofs.\u201d"},{"key":"7_CR3","unstructured":"We thank Vaughan Pratt for informing us about the electronic forum on linear logic, and for a compendium of messages about the relational model."},{"key":"7_CR4","unstructured":"The abbreviations used in the table are the following: add. for additive, mult, for multiplicative, exp. for exponential, conj. for conjunctive and disj. for disjunctive."},{"key":"7_CR5","unstructured":"Note that the additive operators of linear logic correspond to the absolute or Boolean operators of relation algebra and the multiplicative operators to the relative or Peircean operators [Tarski 1941]."}],"container-title":["Relational Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6510-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T09:45:30Z","timestamp":1606124730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6510-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783211829714","9783709165102"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6510-2_7","relation":{},"subject":[],"published":{"date-parts":[[1997]]}}}