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.

Podrobná bibliografia

Vydané v:	Journal of philosophical logic Ročník 33; číslo 6; s. 631 - 637
Hlavní autori:	Aitken, Wayne, Barrett, Jeffrey A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Kluwer Academic Publishers 01.12.2004 Springer Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!