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 | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesEdward Yalow (1977). Yaq: A 360 Assembler Version of the Algorithm Aq and Comparison with Other Pl/I Programs. Department of Computer Science, University of Illinois at Urbana-Champaign.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Jeffrey Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Andrew Bacon (2013). Curry's Paradox and Omega Inconsistency. Studia Logica 101 (1):1-9.
Susan Rogerson (2007). Natural Deduction and Curry's Paradox. Journal of Philosophical Logic 36 (2):155 - 179.
Wayne Aitken & Jeffrey A. Barrett (2004). Computer Implication and the Curry Paradox. Journal of Philosophical Logic 33 (6):631-637.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #201,730 of 548,984 )Recent downloads (6 months)1 ( #63,327 of 548,984 )How can I increase my downloads? |
My notes
Discussion
