Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot (...) prove that the system itself is consistent (assuming it is indeed consistent). These results have had a great impact on the philosophy of mathematics and logic. There have been attempts to apply the results also in other areas of philosophy such as the philosophy of mind, but these attempted applications are more controversial. The present entry surveys the two incompleteness theorems and various issues surrounding them. (shrink)

An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...) with some intuitions underlying Wittgenstein’s philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any mathematical question. (shrink)

Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...) successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy (...) of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent, and that we cannot fully describe our notion of a natural number. (shrink)

This article examines Hilary Putnam's work in the philosophy of mathematics and - more specifically - his arguments against mathematical realism or objectivism. These include a wide range of considerations, from Gödel's incompleteness-theorem and the limits of axiomatic set-theory as formalised in the Löwenheim-Skolem proof to Wittgenstein's sceptical thoughts about rule-following, Michael Dummett's anti-realist philosophy of mathematics, and certain problems – as Putnam sees them – with the conceptual foundations of Peano arithmetic. He also adopts a thought-experimental approach – a (...) variant of Descartes' dream scenario – in order to establish the in-principle possibility that we might be deceived by the apparent self-evidence of basic arithmetical truths or that it might be ‘rational’ to doubt them under some conceivable set of circumstances. Thus Putnam assumes that mathematical realism involves a self-contradictory ‘Platonist’ idea of our somehow having quasi-perceptual epistemic ‘contact’ with truths that in their very nature transcend the utmost reach of human cognitive grasp. On this account, quite simply, ‘nothing works’ in philosophy of mathematics since wecan either cling to that unworkable notion of objective truth or abandon mathematical realism in favour of a verificationist approach that restricts the range of admissible statements to those for which we happen to possess some means of proof or ascertainment. My essay puts the case, conversely, that these hyperbolic doubts are not forced upon us but result from a false understanding of mathematical realism – a curious mixture of idealist and empiricist themes – which effectively skews the debate toward a preordained sceptical conclusion. I then go on to mount a defence of mathematical realism with reference to recent work in this field and also to indicate some problems – as I seethem – with Putnam's thought-experimental approach as well ashis use of anti-realist arguments from Dummett, Kripke, Wittgenstein, and others. (shrink)

Arithmetical self-reference through diagonalization is compared with self-recognition in a mirror, in a series of diagrams that show the structure and main stages of construction of self-referential sentences. A Gödel code is compared with a mirror, Gödel numbers with mirror images, numerical reference to arithmetical formulas with using a mirror to see things indirectly, self-reference with looking at one’s own image, and arithmetical provability of self-reference with recognition of the mirror image. The comparison turns arithmetical self-reference into an idealized model (...) of self-recognition and the conception(s) of self based on that capacity. (shrink)