Computer implication and the Curry paradox

Journal of Philosophical Logic 33 (6):631-637 (2004)
There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation
Keywords Curry paradox  implication  modus ponens  theory of algorithms
Categories (categorize this paper)
DOI 10.1023/B:LOGI.0000046077.72722.61
 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: 15,904
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
John Myhill (1984). Paradoxes. Synthese 60 (1):129 - 143.

Add more references

Citations of this work BETA
Eric Thomas Updike (2012). Abstraction in Fitch's Basic Logic. History and Philosophy of Logic 33 (3):215-243.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #213,207 of 1,725,464 )

Recent downloads (6 months)

3 ( #211,098 of 1,725,464 )

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.