Article contents
Cartesian isomorphisms are symmetric monoidal: A justification of linear logic
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1999
References
REFERENCES
- 2
- Cited by