The paper is devoted to the discussion of some philosophical and historical problems connected with the theorem on the undefinability of the notion of truth. In particular the problem of the priority of proving this theorem will be considered. It is claimed that Tarski obtained this theorem independently though he made clear his indebtedness to Gödel’s methods. On the other hand, Gödel was aware of the formal undefinability of truth in 1931, but he did not publish this result. Reasons for (...) that are also considered. (shrink)

Godel began to seriously study Husserl's phenomenology in 1959, and the Godel Nachlass is known to contain many notes on Husserl. In this paper I describe what is presently known about Godel's interest in phenomenology. Among other things, it appears that the 1963 supplement to "What is Cantor's Continuum Hypothesis?", which contains Godel's famous views on mathematical intuition, may have been influenced by Husserl. I then show how Godel's views on mathematical intuition and objectivity can be readily interpreted in a (...) phenomenological theory of intuition and mathematical knowledge. (shrink)

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...) Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14. (shrink)

This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.

Shortly after Kurt Gödel had announced an early version of the 1st incompleteness theorem, John von Neumann wrote a letter to inform him of a remarkable discovery, i.e. that the consistency of a formal system containing arithmetic is unprovable, now known as the 2nd incompleteness theorem. Although today von Neumann’s proof of the theorem is considered lost, recent literature has explored many of the issues surrounding his discovery. Yet, one question still awaits a satisfactory answer: how did von Neumann achieve (...) his result, knowing as little as he seemingly did about the 1st incompleteness theorem? In this article, I shall advance a conjectural argument to answer this question, after having rejected the argument widely shared in the literature and having analyzed the relevant documents surrounding his discovery. The argument I shall advance strictly links two of the three letters written by von Neumann to Gödel in the late 1930 and early 1931 (i.e. respectively that of November 20, 1930 and that of January 12, 1931) and finds the key for von Neumann’s discovery in his prompt understanding of the Gödel sentence A – as the documents refer to it – as expressing consistency for a formal system that contains arithmetic. (shrink)

Two young logicians, whose work had a dramatic impact on the direction of logic, exchanged two letters in early 1931. Jacques Herbrand initiated the correspondence on 7 April and Kurt Gödel responded on 25 July, just two days before Herbrand died in a mountaineering accident at La Bérarde (Isère). Herbrand's letter played a significant role in the development of computability theory. Gödel asserted in his 1934 Princeton Lectures and on later occasions that it suggested to him a crucial part of (...) the definition of a general recursive function. Understanding this role in detail is of great interest as the notion is absolutely central. The full text of the letter had not been available until recently, and its content (as reported by Gödel) was not in accord with Herbrand's contemporaneous published work. Together, the letters reflect broader intellectual currents of the time: they are intimately linked to the discussion of the incompleteness theorems and their potential impact on Hilbert's Program. (shrink)

This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...) today is predicativistic constructivism based on Martin-Löf type theory. Associated philosophical foundations are meaning theories in the tradition of Wittgenstein, Dummett, Prawitz and Martin-Löf. What is the relation between proof-theoretical semantics in the tradition of Gentzen, Prawitz, and Martin-Löf and Wittgensteinian or other accounts of meaning-as-use? What can proof-theoretical analyses tell us about the scope and limits of constructive and predicative mathematics? (shrink)

This article provides an English translation of a historic discussion on the foundations of mathematics, during which Kurt GÖdel first announced his incompleteness theorem to the mathematical world. The text of the discussion is preceded by brief background remarks and commentary.

This paper surveys the interactions between Russell and Gödel, both personal and intellectual. After a description of Russell’s influence on Gödel, it concludes with a discussion of Russell’s reaction to the incompleteness theorems.

Contacts of the two logicians are listed, and all Gödel's written mentions of Tarski's work are quoted. Why did Gödel almost never mention Tarski's definition of truth in his notes and papers? This puzzle of Gödel's silence, proposed by Feferman, is not merely biographical or psychological but has interesting connections to Gödel's philosophical views.No satisfactory answer is given by the three “standard” explanations: no need to repeat the work already done; Tarski's achievement was obvious to Gödel; Gödel's exceptional caution. In (...) fact, , Tarski had done the work, but Gödel almost never mentioned the achievement; , the obviousness is no explanation for the omission of Tarski's work in contexts in which an application of the definition of satisfaction was useful, and even necessary; , the point was not just caution: if Gödel had felt the need to mention the program of scientific semantics he could easily have done that in his manuscripts, or in conversations.Three ideas, detectable in Gödel's approach, can help us understand Gödel's silence: the idea of truth as the intuitive provability in the most general sense; defining it set-theoretically would contribute nothing. the idea of truth as an inexhaustible idea in the sense of Kant; “truth in general” is a category that must be applicable to all kinds of sentential expressions; also, while for Gödel language was secondary, Tarski's definition is focused on language. the idea of logic as the universal language, in Hintikka's sense, as opposed to the perception of logic as a reinterpretable calculus; hence the thesis that semantics is inexpressible. Gödel always remains a Platonist who asks a natural question: what does really happen in the realm of abstract objects? (shrink)