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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Beall, J. C.: Curry's paradox, in Edward N. Zalta (ed.), The Stanford Encylopedia of Philosophy, Spring 2001 edn, URL = http://plato.stanford.edu/archives/ spr2001/entries/curry-paradox/
Curry, H.: The inconsistency of certain formal logics, J. Symbolic Logic 7 (1942), 115-117.
Fitch, F. B.: A method for avoiding the Curry paradox, in N. Rescher (ed.), Essays in Honor of Carl G. Hempel, 1969, pp. 255-265.
Myhill, J.: Paradoxes, Synthese 60 (1984), 129-143.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aitken, W., Barrett, J.A. Computer Implication and the Curry Paradox. Journal of Philosophical Logic 33, 631–637 (2004). https://doi.org/10.1023/B:LOGI.0000046077.72722.61
Issue Date:
DOI: https://doi.org/10.1023/B:LOGI.0000046077.72722.61