Penrose's new argument

Journal of Philosophical Logic 30 (3):241-250 (2001)
It has been argued, by Penrose and others, that Gödel's proof of his first incompleteness theorem shows that human mathematics cannot be captured by a formal system F: the Gödel sentence G(F) of F can be proved by a (human) mathematician but is not provable in F. To this argment it has been objected that the mathematician can prove G(F) only if (s)he can prove that F is consistent, which is unlikely if F is complicated. Penrose has invented a new argument intended to avoid this objection. In the paper I try to show that Penrose's new argument is inconclusive
Keywords Gödel's proof  formal system  human mathematical reasoning
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,232
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.

Citations of this work BETA
Similar books and articles

Monthly downloads

Added to index


Total downloads

33 ( #82,734 of 1,699,739 )

Recent downloads (6 months)

1 ( #362,609 of 1,699,739 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.