Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-25T12:25:07.506Z Has data issue: false hasContentIssue false

The logic of linear functors

Published online by Cambridge University Press:  16 September 2002

R. BLUTE
Affiliation:
Department of Mathematics and Statistics, University of Ottawa, 585 King Edward St, Ottawa, ON, K1N6N5, Canada. Email: [email protected]
J. R. B. COCKETT
Affiliation:
Department of Mathematics and Statistics, University of Ottawa, 585 King Edward St, Ottawa, ON, K1N6N5, Canada. Email: [email protected]
R. A. G. SEELY
Affiliation:
Department of Mathematics and Statistics, University of Ottawa, 585 King Edward St, Ottawa, ON, K1N6N5, Canada. Email: [email protected]

Abstract

This paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able to handle logics as diverse as modal logic, ordinary linear logic, and the ‘noncommutative logic’ of Abrusci and Ruet, a variant of linear logic that has both commutative and noncommutative connectives.

Although this paper will not consider in depth the categorical basis of this approach to logic, preferring instead to emphasise the syntactic novelties that it generates in the logic, we shall focus on the particular case when the logics are based on a linear functor, in order to give a definite presentation of these ideas. However, it will be clear that this approach to logic has considerable generality.

Type
Research Article
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)