Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T20:42:28.689Z Has data issue: false hasContentIssue false

Cartesian isomorphisms are symmetric monoidal: A justification of linear logic

Published online by Cambridge University Press:  12 March 2014

Kosta Došen
Affiliation:
Irit, University of Toulouse III, 31062 Toulouse Cedex, FranceMathematical Institute, P. O. Box 367, 11001 Belgrade, Yugoslavia
Zoran Petrić
Affiliation:
University of Belgrade, Faculty of Mining and Geology, Djušina 7, 11000 Belgrade, Yugoslavia

Abstract

It is proved that all the isomorphisms in the cartesian category freely generated by a set of objects (i.e., a graph without arrows) can be written in terms of arrows from the symmetric monoidal category freely generated by the same set of objects. This proof yields an algorithm for deciding whether an arrow in this free cartesian category is an isomorphism.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

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.)

Article purchase

Temporarily unavailable