Cartesian Isomorphisms are Symmetric Monoidal: A Justification of Linear Logic

Journal of Symbolic Logic 64 (1):227-242 (1999)
  Copy   BIBTEX

Abstract

It is proved that all the isomorphisms in the cartesian category freely generated by a set of objects 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Proof of a conjecture of S. Mac Lane.S. Soloviev - 1997 - Annals of Pure and Applied Logic 90 (1-3):101-162.
Coherence in substructural categories.Zoran Petrić - 2002 - Studia Logica 70 (2):271 - 296.
Coherence in Substructural Categories.Zoran Petrić - 2002 - Studia Logica 70 (2):271-296.
Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
Coherence in Substructural Categories.Zoran Petrić - 2002 - Studia Logica 70 (2):271-296.
Coherence in SMCCs and equivalences on derivations in IMLL with unit.L. Mehats & Sergei Soloviev - 2007 - Annals of Pure and Applied Logic 147 (3):127-179.

Analytics

Added to PP
2017-02-21

Downloads
6 (#1,484,933)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references