Computer Implication and the Curry Paradox

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.

Saved in:
Bibliographic Details
Published in:Journal of philosophical logic Vol. 33; no. 6; pp. 631 - 637
Main Authors: Aitken, Wayne, Barrett, Jeffrey A.
Format: Journal Article
Language:English
Published: Dordrecht Kluwer Academic Publishers 01.12.2004
Springer
Springer Nature B.V
Subjects:
Algorithms
Computers
Goldbachs conjecture
Libraries
Logic
Modus ponens
Paradoxes
Philosophical logics. Philosophy of language
Philosophy
Proof by contradiction
Syntactical consequents
United States > US
Logics
ISSN:0022-3611, 1573-0433
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0022-3611
1573-0433
DOI:10.1023/B:LOGI.0000046077.72722.61