Deductive completeness

Bulletin of Symbolic Logic 2 (3):243-283 (1996)
This 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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/420991
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 20,048
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Kosta Dosen (2006). Models of Deduction. Synthese 148 (3):639 - 657.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

27 ( #140,993 of 1,793,280 )

Recent downloads (6 months)

2 ( #344,495 of 1,793,280 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.