Computer implication and the Curry paradox

Journal of Philosophical Logic 33 (6):631-637 (2004)
Abstract
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
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,191
Through your library
References found in this work BETA
Paradoxes.John Myhill - 1984 - Synthese 60 (1):129 - 143.

Add more references

Citations of this work BETA
Abstraction in Fitch's Basic Logic.Eric Thomas Updike - 2012 - History and Philosophy of Logic 33 (3):215-243.
Stability and Paradox in Algorithmic Logic.Wayne Aitken & Jeffrey A. Barrett - 2006 - Journal of Philosophical Logic 36 (1):61 - 95.
Abstraction in Algorithmic Logic.Wayne Aitken & Jeffrey A. Barrett - 2008 - Journal of Philosophical Logic 37 (1):23-43.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

50 ( #104,996 of 2,172,047 )

Recent downloads (6 months)

1 ( #325,337 of 2,172,047 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums