{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:10:00Z","timestamp":1649193000961},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2002,9,16]],"date-time":"2002-09-16T00:00:00Z","timestamp":1032134400000},"content-version":"unspecified","delay-in-days":46,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,8]]},"abstract":"This paper describes a family of logics whose categorical semantics is based on functors \nwith structure rather than on categories with structure. This allows the consideration of \nlogics that contain possibly distinct logical subsystems whose interactions are mediated by \nfunctorial mappings. For example, within one unified framework, we shall be able to handle \nlogics as diverse as modal logic, ordinary linear logic, and the \u2018noncommutative logic\u2019 of \nAbrusci and Ruet, a variant of linear logic that has both commutative and noncommutative \nconnectives.<\/jats:p>Although this paper will not consider in depth the categorical basis of this approach to \nlogic, preferring instead to emphasise the syntactic novelties that it generates in the logic, we \nshall focus on the particular case when the logics are based on a linear functor, in order to \ngive a definite presentation of these ideas. However, it will be clear that this approach to \nlogic has considerable generality.<\/jats:p>","DOI":"10.1017\/s0960129502003717","type":"journal-article","created":{"date-parts":[[2002,9,20]],"date-time":"2002-09-20T12:50:31Z","timestamp":1032526231000},"page":"513-539","source":"Crossref","is-referenced-by-count":2,"title":["The logic of linear functors"],"prefix":"10.1017","volume":"12","author":[{"given":"R.","family":"BLUTE","sequence":"first","affiliation":[]},{"given":"J. R. B.","family":"COCKETT","sequence":"additional","affiliation":[]},{"given":"R. A. G.","family":"SEELY","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,9,16]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129502003717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:33:17Z","timestamp":1554319997000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129502003717\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0960129502003717"],"URL":"https:\/\/doi.org\/10.1017\/s0960129502003717","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}