Etica E Politica 5 (1):1 (2003)

In this paper Lucas suggests that many of his critics have not read carefully neither his exposition nor Penrose’s one, so they seek to refute arguments they never proposed. Therefore he offers a brief history of the Gödelian argument put forward by Gödel, Penrose and Lucas itself: Gödel argued indeed that either mathematics is incompletable – that is axioms can never be comprised in a finite rule and so human mind surpasses the power of any finite machine – or there exist absolutely unsolvable diophantine problems, and he suggest that the second disjunct is untenable; on the other side, Penrose proposed an argument similar to Lucas’ one but making use of Turing’s theorem. Finally Lucas exposes again his argument and considers some of the most important objections to it
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Computability and Human Symbolic Output.Jason Megill & Tim Melvin - 2014 - Logic and Logical Philosophy 23 (4):391-401.
Understanding, Expression and Unwelcome Logic.Štěpán Holub - 2020 - Studia Semiotyczne 34 (1):183-202.

Add more citations

Similar books and articles


Added to PP index

Total views
180 ( #59,606 of 2,454,980 )

Recent downloads (6 months)
21 ( #34,078 of 2,454,980 )

How can I increase my downloads?


My notes