Cartesian isomorphisms are symmetric monoidal: A justification of linear logic

DC Field	Value	Language
dc.contributor.author	Došen, Kosta	en
dc.contributor.author	Petrić, Zoran	en
dc.date.accessioned	2020-04-12T18:10:35Z	-
dc.date.available	2020-04-12T18:10:35Z	-
dc.date.issued	1999-01-01	en
dc.identifier.issn	0022-4812	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/354	-
dc.description.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.	en
dc.publisher	Association for Symbolic Logic	-
dc.relation.ispartof	Journal of Symbolic Logic	en
dc.title	Cartesian isomorphisms are symmetric monoidal: A justification of linear logic	en
dc.type	Article	en
dc.identifier.doi	10.2307/2586761	en
dc.identifier.scopus	2-s2.0-0038938256	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	227	en
dc.relation.lastpage	242	en
dc.relation.issue	1	en
dc.relation.volume	64	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2049-9892	-

3

checked on Jun 1, 2024

42

checked on May 9, 2024

Check