Kurt Gödel is almost as famous—one might say “notorious”—for his extreme platonist views as he is famous for his mathematical theorems. Moreover his platonism is not a myth; it is well-documented in his writings. Here are two platonist declarations about set theory, the first from his paper about Bertrand Russell and the second from the revised version of his paper on the Continuum Hypotheses.Classes and concepts may, however, also be conceived as real objects, namely classes as “pluralities of things” or (...) as structures consisting of a plurality of things and concepts as the properties and relations of things existing independently of our definitions and constructions.It seems to me that the assumption of such objects is quite as legitimate as the assumption of physical bodies and there is quite as much reason to believe in their existence.But, despite their remoteness from sense experience, we do have something like a perception also of the objects of set theory, as is seen from the fact that the axioms force themselves upon us as being true. I don't see any reason why we should have less confidence in this kind of perception, i.e., in mathematical intuition, than in sense perception.The first statement is a platonist declaration of a fairly standard sort concerning set theory. What is unusual in it is the inclusion of concepts among the objects of mathematics. This I will explain below. The second statement expresses what looks like a rather wild thesis. (shrink)

This book constitutes the refereed proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997. The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity.

A structure has a (finite-string)automatic presentationif the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.

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)

Proofs of Gödel's First Incompleteness Theorem are often accompanied by claims such as that the gödel sentence constructed in the course of the proof says of itself that it is unprovable and that it is true. The validity of such claims depends closely on how the sentence is constructed. Only by tightly constraining the means of construction can one obtain gödel sentences of which it is correct, without further ado, to say that they say of themselves that they are unprovable (...) and that they are true; otherwise a false theory can yield false gödel sentences. (shrink)

Following Post program, we will propose a linguistic and empirical interpretation of Gödel’s incompleteness theorem and related ones on unsolvability by Church and Turing. All these theorems use the diagonal argument by Cantor in order to find limitations in finitary systems, as human language, which can make “infinite use of finite means”. The linguistic version of the incompleteness theorem says that every Turing complete language is Gödel incomplete. We conclude that the incompleteness and unsolvability theorems find limitations in our finitary (...) tool, which is our complete language. (shrink)

Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities, concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.

Within a weak subsystem of second-order arithmetic , that is -conservative over , we reformulate Kreisel's proof of the Second Incompleteness Theorem and Boolos' proof of the First Incompleteness Theorem.

Over the last few decades Michael Dummett developed a rich program for assessing logic and the meaning of the terms of a language. He is also a major exponent of Frege's version of logicism in the philosophy of mathematics. Over the last decade, Neil Tennant developed an extensive version of logicism in Dummettian terms, and Dummett influenced other contemporary logicists such as Crispin Wright and Bob Hale. The purpose of this paper is to explore the prospects for Fregean logicism within (...) a broadly Dummettian framework. The conclusions are mostly negative: Dummett's views on analyticity and the logical/non-logical boundary leave little room for logicism. Dummett's considerations concerning manifestation and separability lead to a conservative extension requirement: if a sentence S is logically true, then there is a proof of S which uses only the introduction and elimination rules of the logical terms that occur in S. If basic arithmetic propositions are logically true-as the logicist contends-then there is tension between this conservation requirement and the ontological commitments of arithmetic. It follows from Dummett's manifestation requirements that if a sentence S is composed entirely of logical terminology, then there is a formal deductive system D such that S is analytic, or logically true, if and only if S is a theorem of D. There is a deep conflict between this result and the essential incompleteness, or as Dummett puts it, the indefinite extensibility, of arithmetic truth. (shrink)

In this first extended treatment of his life and work, Hao Wang, who was in close contact with Godel in his last years, brings out the full subtlety of Godel's ideas and their connection with grand themes in the history of mathematics and ...

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)

Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We argue, (...) however, that the alternative argument raises a circularity problem. In sum, Gödel’s and its related theorem merely show the relation between a complete and a consistent theory. A contradiction derived by the application of Gödel sentence has the value of true sentences, i.e. the both-value, only under the inconsistent models for arithmetic. Without having the assumption of inconsistency or completeness, a true contradiction is not derivable from the application of Gödel sentence. Hence, Gödel’s and its related theorem never can be a ground for Dialetheism. (shrink)

In his paper on the incompleteness theorems, Gödel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that ‘direct’ self-reference can actually be used to prove his result.

Gödel appears to have believed strongly that the human mind cannot be explained in terms of any kind of computational physics, but he remained cautious in formulating this belief as a rigorous consequence of his incompleteness theorems. In this chapter, I discuss a modification of standard Gödel-type logical arguments, these appearing to strengthen Gödel’s conclusions, and attempt to provide a persuasive case in support of his standpoint that the actions of the mind must transcend computation. It appears that Gödel did (...) not consider the possibility that the laws of physics might themselves involve noncomputational procedures; accordingly, he found himself driven to the conclusion that mentality must lie beyond the actions of the physical brain. My own arguments, on the other hand, are from the scientific standpoint that the mind is a product of the brain’s physical activity. Accordingly, there must be something in the physical actions of the world that itself transcends computation. We do not appear to find such noncomputational action in the known laws of physics, however, so we must seek it in currently undiscovered laws going beyond presently accepted physical theory. I argue that the only plausibly relevant gap in current understanding lies in a fundamental incompleteness in quantum theory, which reveals itself only with significant mass displacements between quantum states (“Schrödinger’s cats”). I contend that the need for new physics enters when gravitational effects just begin to play a role. In a scheme developed jointly with Stuart Hameroff, this has direct relevance within neuronal microtubules, and I describe this (still speculative) scheme in the following. (shrink)

This is a companion to a paper by the authors entitled “Gödel’s natural deduction,” which presented and made comments about the natural deduction system in Gödel’s unpublished notes for the elementary logic course he gave at the University of Notre Dame in 1939. In that earlier paper, which was itself a companion to a paper that examined the links between some philosophical views ascribed to Gödel and general proof theory, one can find a brief summary of Gödel’s notes for the (...) Notre Dame course. In order to put the earlier paper in proper perspective, a more complete summary of these interesting notes, with comments concerning them, is given here. (shrink)

Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities (sets), concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.

Gödel once offered an argument for the general reflection principle in set theory that took the form of an analogy with Leibniz' Monadology. I discuss the mathematical and philosophical background to Gödel's argument, reconstruct the proposed analogy in detail, and argue that it has no justificatory force.

This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are (...) neither provable nor refutable. The first theorem is general in the sense that it applies to any axiomatic theory, which is ω-consistent, has an effective proof procedure, and is strong enough to represent basic arithmetic. Their importance lies in their generality: although proved specifically for extensions of system, the method Gödel used is applicable in a wide variety of circumstances. Gödel's results had a profound influence on the further development of the foundations of mathematics. It pointed the way to a reconceptualization of the view of axiomatic foundations. (shrink)

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...) at Princeton in 1934. Seen in the historical context, Gödel was an important catalyst for the emergence of computability theory in the mid 1930s. (shrink)

This paper is a discussion of Gödel's arguments for a Platonistic conception of mathematical objects. I review the arguments that Gödel offers in different papers, and compare them to unpublished material (from Gödel's Nachlass). My claim is that Gödel's later arguments simply intend to establish that mathematical knowledge cannot be accounted for by a reflexive analysis of our mental acts. In other words, there is at the basis of mathematics some data whose constitution cannot be explained by introspective analysis. This (...) does not mean that mathematics is independent of the human mind, but only that it is independent of our ?conscious acts and decisions?, to use Gödel's own words. Mathematical objects may then have been created by the human mind, but if so, the process of creation cannot be completely analysed and re-enacted. Such a thesis is weaker than some of the statements that Gödel made about his conceptual realism. However, there is evidence that Gödel seriously considered this weak thesis, or a position depending only on this weak thesis. He also criticized Husserl's Phenomenology from this point of view. (shrink)

The logician Kurt Godel in 1951 established a disjunctive thesis about the scope and limits of mathematical knowledge: either the mathematical mind is equivalent to a Turing machine (i.e., a computer), or there are absolutely undecidable mathematical problems. In the second half of the twentieth century, attempts have been made to arrive at a stronger conclusion. In particular, arguments have been produced by the philosopher J.R. Lucas and by the physicist and mathematician Roger Penrose that intend to show that (...) the mathematical mind is more powerful than any computer. These arguments, and counterarguments to them, have not convinced the logical and philosophical community. The reason for this is an insufficiency if rigour in the debate. The contributions in this volume move the debate forward by formulating rigorous frameworks and formally spelling out and evaluating arguments that bear on Godel's disjunction in these frameworks. The contributions in this volume have been written by world leading experts in the field. (shrink)

This paper presents hitherto unpublished writings of Kurt Gödel concerning logical, epistemological, theological, and physical antinomies, which he generally considered as “the most interesting facts in modern logic,” and which he used as a basis for his famous metamathematical results. After investigating different perspectives on the notion of the logical structure of the antinomies and presenting two “antinomies of the intensional,” a new kind of paradox closely related to Gödel’s ontological proof for the existence of God is introduced and completed (...) by a compilation of further theological antinomies. Finally, after a presentation of unpublished general philosophical remarks concerning the antinomies, Gödel’s type-theoretic variant of Leibniz’Monadology, discovered in his notes on the foundations of quantum mechanics, is examined. Most of the material presented here has been transcribed from the Gabelsberger shorthand system for the first time. (shrink)

Gödel's philosophical views were to a significant extent influenced by the study not only of Leibniz or Husserl, but also of Kant. Both Gödel and Kant aimed at the secure foundation of philosophy, the certainty of knowledge and the solvability of all meaningful problems in philosophy. In this paper, parallelisms between the foundational crisis of metaphysics in Kant's view and the foundational crisis of mathematics in Gödel's view are elaborated, especially regarding the problem of finding the “secure path of a (...) science” for both mathematics and philosophy. Gödel's temporal subjectivism and metaphysical conceptual objectivism are presented as positively or negatively motivated by Kant's viewpoints. A remark on Gödel's collapse of modalities (in accordance with the collapse of objective time) is added. (shrink)

Gödel regarded the Dialectica interpretation as giving constructive content to intuitionism, which otherwise failed to meet reasonable conditions of constructivity. He founded his theory of primitive recursive functions, in which the interpretation is given, on the concept of computable function of finite type. I will (1) criticize this foundation, (2) propose a quite different one, and (3) note that essentially the latter foundation also underlies the Curry-Howard type theory, and hence Heyting's intuitionistic conception of logic. Thus the Dialectica interpretation (in (...) so far as its aim was to give constructive content to intuitionism) is superfluous. (shrink)

We study the topic of realization from classical justification logics in the context of the recently introduced Gödel justification logics. We show that the standard Gödel modal logics of Caicedo and Rodriguez are not realized by the Gödel justification logics and moreover, we study possible extensions of the Gödel justification logics, which are strong enough to realize the standard Gödel modal logics. On the other hand, we study the fragments of the standard Gödel modal logics, which are realized by the (...) usual Gödel justification logics. We prove the corresponding realization theorem by using Fitting’s merging of realizations as well as appropriate hypersequent calculi on the modal side, adapting the work by Metcalfe and Olivetti. For these hypersequent calculi, we also show a cut-elimination theorem. We provide natural semantical characterizations for all of these newly introduced logics. (shrink)

Gödel algebras form the locally finite variety of Heyting algebras satisfying the prelinearity axiom =. In 1969, Horn proved that a Heyting algebra is a Gödel algebra if and only if its set of prime filters partially ordered by reverse inclusion–i.e. its prime spectrum–is a forest. Our main result characterizes Gödel algebras that are free over some finite distributive lattice by an intrisic property of their spectral forest.

This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic even when classical logic is used for logical closure in the object language.

What seem to be Kurt Gödel’s first notes on logic, an exercise notebook of 84 pages, contains formal proofs in higher-order arithmetic and set theory. The choice of these topics is clearly suggested by their inclusion in Hilbert and Ackermann’s logic book of 1928, the Grundzüge der theoretischen Logik. Such proofs are notoriously hard to construct within axiomatic logic. Gödel takes without further ado into use a linear system of natural deduction for the full language of higher-order logic, with formal (...) derivations closer to one hundred steps in length and up to four nested temporary assumptions with their scope indicated by vertical intermittent lines. (shrink)

Gödel’s philosophical rationalism includes a program for “developing philosophy as an exact science.” Gödel believes that Husserl’s phenomenology is essential for the realization of this program. In this article, by analyzing Gödel’s philosophy of idealism, conceptual realism, and his concept of “abstract intuition,” based on clues from Gödel’s manuscripts, I try to investigate the reasons why Gödel is strongly interested in Husserl’s phenomenology and why his program for an exact philosophy is unfinished. One of the topics that has attracted much (...) attention recently is the development of Gödel’s philosophical thoughts and its connection with other philosophical ideas. For instance, some scholars are searching for the possible connections between Gödel’s philosophy and Husserl’s phenomenology and examining if there is any solid evidence of Husserl’s influence on Gödel from Gödel’s works (Tieszen, Bull Symbolic Logic 4(2):181–203, 1998; Huaser, Bull Symbolic Logic 12(4):529–588, 2006). Why is Gödel’ s interested in Husserl? How should this turn to Husserl be interpreted? Is it a dismissal of Leibnizian philosophy, or a different way to achieve similar goals? Way did Gödel turn specifically to Husserl’s transcendental idealism? (Van Atten and Kennedy, Bull Symbolic Logic 9(4):425–476, 2003) I believe, the reason is that Gödel has a valuable program for “developing philosophy as an exact science” and he believes that Husserl’s phenomenology is relevant to the realization of this program. So far there are no sufficient evidence to show that there is a direct inheritance relation between Gödel’s and Husserl’s thoughts. However, from the clues in Gödel’s idealistic philosophy, conceptual realism, and his concept of “abstract intuition,” we can perhaps explore some similarities between his thoughts and Husserl’s thoughts, and analyze the reason why Gödel is interested in Husserl’s phenomenology and why his program for an exact philosophy is unfinished. (shrink)

Gödel has argued that we can cultivate the intuition or ‘perception’ of abstractconcepts in mathematics and logic. Gödel's ideas about the intuition of conceptsare not incidental to his later philosophical thinking but are related to many otherthemes in his work, and especially to his reflections on the incompleteness theorems.I describe how some of Gödel's claims about the intuition of abstract concepts are related to other themes in his philosophy of mathematics. In most of this paper, however,I focus on a central (...) question that has been raised in the literature on Gödel: what kind of account could be given of the intuition of abstract concepts? I sketch an answer to this question that uses some ideas of a philosopher to whom Gödel also turned in this connection: Edmund Husserl. The answer depends on how we understand the conscious directedness toward ‘objects’ and the meaning of the term ‘abstract’ in the context of a theory of the intentionality of cognition. (shrink)

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, _Godel’s Proof_ by Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and (...) philosophy the chance to satisfy their intellectual curiosity. (shrink)

The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem’s dependency regarding Gödel numberings. I introducedeviantnumberings, yielding provability predicates satisfying Löb’s conditions, which result in provable consistency sentences. According to the main result of this paper however, these (...) “counterexamples” do not refute the theorem’s prevalent interpretation, since once a natural class ofadmissiblenumberings is singled out, invariance is maintained. (shrink)

The paper continues my earlier Chat with OpenAI’s ChatGPT with a Focused LLM Experiment (FLEX). The idea is to conduct Large Language Model (LLM) based explorations of certain areas or concepts. The approach is based on crafting initial guiding prompts and then follow up with user prompts based on the LLMs’ responses. The goals include improving understanding of LLM capabilities and their limitations culminating in optimized prompts. The specific subjects explored as research subject matter include a) diagonalization techniques as practiced (...) by Cantor, Turing, Gödel, and the advances, such as the Forcing techniques introduced by Paul Cohen and later investigators, b) Knowledge Hierarchies & Mapping Exercises, c) Discussions of IJ Good’s Speculations Concerning the First Ultraintelligent Machine, AGI, and Super- intelligence. Results suggest variability between major models like ChatGPT-4, Llama-3, Cohere, Sonnet and Opus. Results also point to strong dependence on users’ preexisting knowledge and skill bases. The paper should be viewed as ’raw data’ rather than a polished authoritative reference. (shrink)

Inspired from Buchholz' ordinal analysis of ID1 and Beckmann's analysis of the simple typed λ-calculus we classify the derivation lengths for Gödel's system T in the λ-formulation.

This brief text assists students in understanding Godel's philosophy and thinking so that they can more fully engage in useful, intelligent class dialogue and improve their understanding of course content. Part of the "Wadsworth Philosophers Series," (which will eventually consist of approximately 100 titles, each focusing on a single "thinker" from ancient times to the present), ON GODEL is written by a philosopher deeply versed in the philosophy of this key thinker. Like other books in the series, this (...) concise book offers sufficient insight into the thinking of a notable philosopher better enabling students to engage in the reading and to discuss the material in class and on paper.". (shrink)