After Gödel: Mechanism, Reason, and Realism in the Philosophy of Mathematics

Philosophia Mathematica 14 (2):229-254 (2006)
  Copy   BIBTEX

Abstract

In his 1951 Gibbs Lecture Gödel formulates the central implication of the incompleteness theorems as a disjunction: either the human mind infinitely surpasses the powers of any finite machine or there exist absolutely unsolvable diophantine problems (of a certain type). In his later writings in particular Gödel favors the view that the human mind does infinitely surpass the powers of any finite machine and there are no absolutely unsolvable diophantine problems. I consider how one might defend such a view in light of Gödel's remark that one can turn to ideas in Husserlian transcendental phenomenology to show that the human mind ‘contains an element totally different from a finite combinatorial mechanism’.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Are There Absolutely Unsolvable Problems? Godel's Dichotomy.S. Feferman - 2006 - Philosophia Mathematica 14 (2):134-152.
Gödel’s Disjunctive Argument†.Wesley Wrigley - 2022 - Philosophia Mathematica 30 (3):306-342.
Proving that the Mind Is Not a Machine?Johannes Stern - 2018 - Thought: A Journal of Philosophy 7 (2):81-90.
Gödel’s Philosophical Challenge.Wilfried Sieg - 2020 - Studia Semiotyczne 34 (1):57-80.
On Martin-Löf’s Constructive Optimism.V. Alexis Peluce - 2020 - Studia Semiotyczne 34 (1):233-242.
Gödels disjunctie.L. Horsten - 1998 - Tijdschrift Voor Filosofie 60 (1):83 - 105.
Reasoning from paradox.Laureano Luna - 2011 - The Reasoner 5 (2):22-23.

Analytics

Added to PP
2010-08-17

Downloads
83 (#69,098)

6 months
18 (#821,922)

Historical graph of downloads
How can I increase my downloads?