Computer implication and the Curry paradox

Journal of Philosophical Logic 33 (6):631-637 (2004)

Authors
Jeffrey Barrett
University of California, Irvine
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,293
Through your library

References found in this work BETA

The Inconsistency of Certain Formal Logic.Haskell B. Curry - 1942 - Journal of Symbolic Logic 7 (3):115-117.
Paradoxes.John Myhill - 1984 - Synthese 60 (1):129 - 143.
The Inconsistency of Certain Formal Logics.Alonzo Church & Haskell B. Curry - 1942 - Journal of Symbolic Logic 7 (4):170.

Add more references

Citations of this work BETA

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.
Abstraction in Fitch's Basic Logic.Eric Thomas Updike - 2012 - History and Philosophy of Logic 33 (3):215-243.
A Note on the Physical Possibility of Transfinite Computation.W. Aitken & J. A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
63 ( #132,444 of 2,270,961 )

Recent downloads (6 months)
4 ( #335,158 of 2,270,961 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature