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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of philosophical logic Ročník 33; číslo 6; s. 631 - 637
Hlavní autoři: Aitken, Wayne, Barrett, Jeffrey A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Kluwer Academic Publishers 01.12.2004
Springer
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0022-3611
1573-0433
DOI:10.1023/B:LOGI.0000046077.72722.61