DC FieldValueLanguage
dc.contributor.authorDošen, Kostaen
dc.date.accessioned2020-04-27T10:33:32Z-
dc.date.available2020-04-27T10:33:32Z-
dc.date.issued1999-01-01en
dc.identifier.issn0138-0680en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/710-
dc.description.abstractThe notion of adjunction is formulated so that for every arrow in freely gener-ated adjunctions there is a composition-free term for this arrow, which can be brought into a normal form unique for the arrow. In this formulation, natural transformations are not conceived as families of arrows, but as operations on arrows. Composition elimination is the form Gentzen's cut elimination takes in categories. The composition-free normal form serves to obtain simple geometri-cal decision procedures for the commuting of diagrams. It serves also to show that adding to the notion of adjunction any new equality between arrows in the language of free adjunctions would trivialize this notion.en
dc.publisherUniversity of Lodz-
dc.relation.ispartofBulletin of the Section of Logicen
dc.titleCut elimination in adjuncionen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84896522560en
dc.identifier.urlhttp://www.mi.sanu.ac.rs/~kosta/Dosen%20radovi/%5BP%5D%5B48%5D%20Cut%20elimination%20in%20adjunction.pdf-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage61en
dc.relation.lastpage73en
dc.relation.issue2en
dc.relation.volume28en
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
Show simple item record

Page view(s)

30
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.