DC FieldValueLanguage
dc.contributor.authorDošen, Kostaen
dc.date.accessioned2020-04-27T10:33:32Z-
dc.date.available2020-04-27T10:33:32Z-
dc.date.issued1996-01-01en
dc.identifier.issn1079-8986en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/713-
dc.description.abstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The connections of the theorem with combinatory logic, and with modal and substructural logics, are briefly considered at the end.en
dc.publisherCambridge University Press-
dc.relation.ispartofBulletin of Symbolic Logicen
dc.titleDeductive completenessen
dc.typeArticleen
dc.identifier.doi10.2307/420991-
dc.identifier.scopus2-s2.0-0030238998en
dc.relation.firstpage243en
dc.relation.lastpage283en
dc.relation.issue3en
dc.relation.volume2en
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

8
checked on Nov 24, 2024

Page view(s)

23
checked on Nov 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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