Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

I argue for the use of the adjunction operator (adding a single new element to an existing set) as a basis for building a finitary set theory. It allows a simplified axiomatization for the first-order theory of hereditarily finite sets based on an induction schema and a rigorous characterization of the primitive recursive set functions. The latter leads to a primitive recursive presentation of arithmetical operations on finite sets.

The paper undertakes to characterize Hao Wang's style, convictions, and method as a philosopher, centering on his most important philosophical work From Mathematics to Philosophy, 1974. The descriptive character of Wang's characteristic method is emphasized. Some specific achievements are discussed: his analyses of the concept of set, his discussion, in connection with setting forth Gödel's views, of minds and machines, and his concept of ‘analytic empiricism’ used to criticize Carnap and Quine. Wang's work as interpreter of Gödel's thought and the (...) importance of his writings as a source are also discussed. (shrink)

The aim of this paper is to challenge Hao Wang's presentation of Gödel's views on the language of mathematics. Hao Wang claimed that the language of mathematics is for Gödel nothing but a sensory tool that helps humans to focus their attention on some abstract objects. According to an alternative interpretation presented here, Gödel believed that the language of mathematics has an important role in acquiring knowledge of the abstract mathematical world. One possible explanation of that role is proposed.

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

This book is concerned with `the problem of existence in mathematics'. It develops a mathematical system in which there are no existence assertions but only assertions of the constructibility of certain sorts of things. It explores the philosophical implications of such an approach through an examination of the writings of Field, Burgess, Maddy, Kitcher, and others.

Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz's, based on reduction to cut-free form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally (...) the rules involved in them they yield the same premises and conclusions up to a renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to low-dimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic. (shrink)

In his text 'The modern development of the foundations of mathematics in the light of philosophy' from around 1961, Go¨del announces a turn to Husserl's phenomenology to find the foundations of mathematics. In Go¨del's archive there are two draft letters that shed some further light on the exact strategy that he formulated for himself in the early 1960s. Transcriptions of these letters are presented, together with some comments.

This article presents three extracts from the introductory course in mathematical logic that Gödel gave at the University of Notre Dame in 1939. The lectures include a few digressions, which give insight into Gödel's views on logic prior to his philosophical papers of the 1940s. The first extract is Gödel's first lecture. It gives the flavour of Gödel's leisurely style in this course. It also includes a curious definition of logic and a discussion of implication in logic and natural language. (...) The second extract is a discussion on undecidability and on Leibniz. The third extract concerns the paradoxes and Russell's theory of types. (shrink)

As initially envisioned, Gödel's Collected Works were to include transcriptions of material from his mathematical workbooks. In the end that material, as well as some other manuscript items from Gödel's Nachlass, had to be left out. This note describes some of the unpublished items in the Nachlass that are likely to attract the notice of scholars and surveys the extent of shorthand transcription efforts undertaken hitherto. Some examples of sources outside Gödel's Nachlass that may be of interest to Gödel scholars (...) are also indicated. (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)

This article is an attempt to present Gödel's discussion on concepts, from 1944 to the late 1970s, in particular relation to the thought of Frege and Russell. The discussion takes its point of departure from Gödel's claim in notes on Bernay's review of ?Russell's mathematical logic?. It then retraces the historical background of the notion of intension which both Russell and Gödel use, and offers some grounds for claiming that Gödel consistently considered logic as a free-type theory of concepts, called (...) intensions, considered as the denotations of predicate names. (shrink)