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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of philosophical logic Jg. 33; H. 6; S. 631 - 637
Hauptverfasser: Aitken, Wayne, Barrett, Jeffrey A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Kluwer Academic Publishers 01.12.2004
Springer
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0022-3611
1573-0433
DOI:10.1023/B:LOGI.0000046077.72722.61