In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (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.

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...) University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, focussing (...) primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic ("Post-") and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged. (shrink)

Abstract:With his theory of descriptions Russell wanted to solve two problems concerning denotation and reference, which are formulated here as Problem I and Problem II. After presenting each problem, we describe the main points of Russell’s solution. We deal with Russell’s concepts of existence and then elaborate his presuppositions concerning the relation of denoting and referring. Next we discuss the presuppositions or principles which underlie Russell’s understanding of the objects of reference. These principles are such that if the objects of (...) reference are material objects, they are objects of classical mechanics, or very close to such an interpretation. Finally we show how these principles have to be relaxed if the objects of reference are objects of quantum mechanics or special or general relativity. (shrink)

The \-substitution method is a technique for giving consistency proofs for theories of arithmetic. We use this technique to give a proof of the consistency of the impredicative theory \ using a variant of the cut-elimination formalism introduced by Mints.

The epsilon calculus improves upon the predicate calculus by systematically providing complete individual terms. Recent research has shown that epsilon terms are therefore the “logically proper names” Russell was not able to formalize, but their use improves upon Russell’s theory of descriptions not just in that way. This paper details relevant formal aspects of the epsilon calculus before tracing its extensive application not just to the theory of descriptions, but also to more general problems with anaphoric reference. It ends by (...) contrasting a Meinongian account of cross-reference in intensional constructions with the epsilon account. (shrink)

On June 4, 1925, Hilbert delivered an address to the Westphalian Mathematical Society in Miinster; that was, as a quick calculation will convince you, almost exactly sixty years ago. The address was published in 1926 under the title Über dasUnendlicheand is perhaps Hilbert's most comprehensive presentation of his ideas concerning the finitist justification of classical mathematics and the role his proof theory was to play in it. But what has become of the ambitious program for securing all of mathematics, once (...) and for all? What of proof theory, the very subject Hilbert invented to carry out his program? The Hilbertian ambition reached out too far: in its original form, the program was refuted by Gödel's Incompleteness Theorems. And even allowing more than finitist means in metamathematics, the Hilbertian expectations for proof theory have not been realized: a constructive consistency proof for second-order arithmetic is still out of reach. Nevertheless, remarkable progress has been made. Two separate, but complementary directions of research have led to surprising insights: classical analysis can be formally developed in conservative extensions of elementary number theory; relative consistency proofs can be given by constructive means for impredicative parts of second order arithmetic. The mathematical and metamathematical developments have been accompanied by sustained philosophical reflections on the foundations of mathematics. This indicates briefly the main themes of the contributions to the symposium; in my introductory remarks I want to give a very schematic perspective, that is partly historical and partly systematic. (shrink)

This paper concerns Carnap’s early contributions to formal semantics in his work on general axiomatics between 1928 and 1936. Its main focus is on whether he held a variable domain conception of models. I argue that interpreting Carnap’s account in terms of a fixed domain approach fails to describe his premodern understanding of formal models. By drawing attention to the second part of Carnap’s unpublished manuscript Untersuchungen zur allgemeinen Axiomatik, an alternative interpretation of the notions ‘model’, ‘model extension’ and ‘submodel’ (...) in his theory of axiomatics is presented. Specifically, it is shown that Carnap’s early model theory is based on a convention to simulate domain variation that is not identical but logically comparable to the modern account. (shrink)

On the basis of a wide range of historical examples various features of axioms are discussed in relation to their use in mathematical practice. A very general framework for this discussion is provided, and it is argued that axioms can play many roles in mathematics and that viewing them as self-evident truths does not do justice to the ways in which mathematicians employ axioms. Possible origins of axioms and criteria for choosing axioms are also examined. The distinctions introduced aim at (...) clarifying discussions in philosophy of mathematics and contributing towards a more refined view of mathematical practice. (shrink)

We demonstrate that the quantum-mechanical description of composite physical systems of an arbitrary number of similar fermions in all their admissible states, mixed or pure, for all finite-dimensional Hilbert spaces, is not in conflict with Leibniz's Principle of the Identity of Indiscernibles (PII). We discern the fermions by means of physically meaningful, permutation-invariant categorical relations, i.e. relations independent of the quantum-mechanical probabilities. If, indeed, probabilistic relations are permitted as well, we argue that similar bosons can also be discerned in all (...) their admissible states; but their categorical discernibility turns out to be a state-dependent matter. In all demonstrated cases of discernibility, the fermions and the bosons are discerned (i) with only minimal assumptions on the interpretation of quantum mechanics; (ii) without appealing to metaphysical notions, such as Scotusian haecceitas, Lockean substrata, Postian transcendental individuality or Adamsian primitive thisness; and (iii) without revising the general framework of classical elementary predicate logic and standard set theory, thus without revising standard mathematics. This confutes: (a) the currently dominant view that, provided (i) and (ii), the quantum-mechanical description of such composite physical systems always conflicts with PII; and (b) that if PII can be saved at all, the only way to do it is by adopting one or other of the thick metaphysical notions mentioned above. Among the most general and influential arguments for the currently dominant view are those due to Schrodinger, Margenau, Cortes, Dalla Chiara, Di Francia, Redhead, French, Teller, Butterfield, Giuntini, Mittelstaedt, Castellani, Krause and Huggett. We review them succinctly and critically as well as related arguments by van Fraassen and Massimi. (shrink)

The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...) of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

In ?Definability and the Structure of Logical Paradoxes? (Australasian Journal of Philosophy, this issue) Haixia Zhong takes issue with an account of the paradoxes of self-reference to be found in Beyond the Limits of Thought [Priest 1995. The point of this note is to explain why the critique does not succeed. The criterion for distinguishing between the set-theoretic and the semantic paradoxes offered does not get the division right; the semantic paradoxes are not given a uniform solution; no reason is (...) provided as to why the naïve denotation relation is ?indefinite? (other than that its definiteness leads to contradiction); and the account of the denotation relation given clearly misses the mark, even by consistent standards. (shrink)

This paper gives a survey of David Hilbert's (1862–1943) changing attitudes towards logic. The logical theory of the Göttingen mathematician is presented as intimately linked to his studies on the foundation of mathematics. Hilbert developed his logical theory in three stages: (1) in his early axiomatic programme until 1903 Hilbert proposed to use the traditional theory of logical inferences to prove the consistency of his set of axioms for arithmetic. (2) After the publication of the logical and set-theoretical paradoxes by (...) Gottlob Frege and Bertrand Russell it was due to Hilbert and his closest collaborator Ernst Zermelo that mathematical logic became one of the topics taught in courses for Göttingen mathematics students. The axiomatization of logic and set-theory became part of the axiomatic programme, and they tried to create their own consistent logical calculi as tools for proving consistency of axiomatic systems. (3) In his struggle with intuitionism, represented by L. E. J. Brouwer and his advocate Hermann Weyl, Hilbert, assisted by Paul Bemays, created the distinction between proper mathematics and meta-mathematics, the latter using only finite means. He considerably revised the logical calculus of thePrincipia Mathematica of Alfred North Whitehead and Bertrand Russell by introducing the ε-axiom which should serve for avoiding infinite operations in logic. (shrink)

This is the introductory essay to a collection commemorating the 100th anniversary of the publication in Mind of Bertrand Russell’s paper ‘On Denoting’.

Machines were introduced as calculating devices to simulate operations carried out by human computers following fixed algorithms. The mathematical study of (paper) machines is the topic of our essay. The first three sections provide necessary logical background, examine the analyses of effective calculability given in the thirties, and describe results that are central to recursion theory, reinforcing the conceptual analyses. In the final section we pursue our investigation in a quite different way and focus on principles that govern the operations (...) of physically realizable machines. (shrink)

, Rudolf Carnap became a chief proponent of the doctrine that the statements of intuitionism carry nonstandard intuitionistic meanings. This doctrine is linked to Carnap's ‘Principle of Tolerance’ and claims he made on behalf of his notion of pure syntax. From premises independent of intuitionism, we argue that the doctrine, the Principle, and the attendant claims are mistaken, especially Carnap's repeated insistence that, in defining languages, logicians are free of commitment to mathematical statements intuitionists would reject. I am grateful to (...) Nathan Carter, Gary Ebbs, Janet Folina, Luise Prior McCarty, Stewart Shapiro, Neil Tennant, Christopher Tillman, Beth Tropman, Wen-fang Wang, and two anonymous referees for their comments and suggestions. CiteULike Connotea Del.icio.us What's this? (shrink)

In a note appended to the translation of “On consistency and completeness” (), Gödel reexamined the problem of the unprovability of consistency. Gödel here focuses on an alternative means of expressing the consistency of a formal system, in terms of what would now be called a ‘reflection principle’, roughly, the assertion that a formula of a certain class is provable in the system only if it is true. Gödel suggests that it is this alternative means of expressing consistency that we (...) should be interested in from a foundational point of view, and he gives a result that shows certain reflection principles to be underivable in extensions of elementary number theory under conditions significantly weaker than the Hilbert-Bernays derivability conditions. In this paper I shall discuss the background to Gödel's result and the foundational significance he claims for it. Along the way, I shall present a new proof of the result which places it in an even more general context than the one considered by Gödel in the 1960s. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Embora algumas posições filosóficas de Gödel sejam bem conhecidas, como o platonismo, a sua teoria do conhecimento é, em comparação, menos divulgada. A partir do «Problema da Evidência» de Hilbert-Bernays, I, pg. 20 seq., apresento a seguir os traços essenciais da posição de Gödel sobre a caracterização epistemológica da evidência finitista, com especial relevo para a história dos conceitos utilizados.

We show that finitely axiomatized first-order theories that involve some criterion of identity for entities of a category C can be reformulated as conjunctions of a non-triviality statement and a criterion of identity for entities of category C again. From this, we draw two conclusions: First, criteria of identity can be very strong deductively. Second, although the criteria of identity that are constructed in the proof of the theorem are not good ones intuitively, it is difficult to say what exactly (...) is wrong with them once the modern metaphysical view of identity criteria is presupposed. (shrink)

Questions about the relation between identity and discernibility are important both in philosophy and in model theory. We show how a philosophical question about identity and dis- cernibility can be ‘factorized’ into a philosophical question about the adequacy of a formal language to the description of the world, and a mathematical question about discernibility in this language. We provide formal definitions of various notions of discernibility and offer a complete classification of their logical relations. Some new and surprising facts are (...) proved; for instance, that weak dis- cernibility corresponds to discernibility in a language with constants for every object, and that weak discernibility is the most discerning nontrivial discernibility relation. (shrink)

Despite the renown of ‘On Denoting’, much criticism has ignored or misconstrued Russell's treatment of scope, particularly in intensional, but also in extensional contexts. This has been rectified by more recent commentators, yet it remains largely unnoticed that the examples Russell gives of scope distinctions are questionable or inconsistent with his own philosophy. Nevertheless, Russell is right: scope does matter in intensional contexts. In Principia Mathematica, Russell proves a metatheorem to the effect that the scope of a single occurrence of (...) a description in an extensional context does not matter, provided existence and uniqueness conditions are satisfied. But attempts to eliminate descriptions in more complicated cases may produce an analysis with more occurrences of descriptions than featured in the analysand. Taking alternation and negation to be primitive (as in the first edition of Principia), this can be resolved, although the proof is non-trivial. Taking the Sheffer stroke to be primitive (as proposed by Russell in the second edition), with bad choices of scope the analysis fails to terminate. (shrink)

Fregean theories of descriptions as terms have to deal with improper descriptions. To save bivalence various proposals have been made that involve assigning referents to improper descriptions. While bivalence is indeed saved, there is a price to be paid. Instantiations of the same general scheme, viz. the one and only individual that is F and G is G, are not only allowed but even required to have different truth values.

Nous publions sous ce titre la traduction française de l'essai philosophique de Kurt Gödel intitulé: «Is Mathematics Syntax of Language?» Inédit jusqu'à présent, l'original paraîtra dans le 3e volume des Collected Works de Gödel, dont la publication est imminente. Nous savons par Hao Wang que, le 15 mai 1953, Paul Arthur Schilpp avait invité Gödel à apporter sa contribution au volume consacré à Carnap dans The Library of Living Philosophers. Le manuscrit de Gödel «Carnap and the Ontology of Mathematics», devait (...) être remis au plus tard le 2 avril 1954. Dés le 2 juillet 1953, Gödel donnait son accord à Schilpp pour la rédaction d'un article intitulé «Some Observations on the Nominalistic View of the Nature of Mathematics.» Cependant, le volume consacré à Carnap paraîtra en 1963 sans qu'y figure la contribution de Gödel. En effet — toujours selon Wang — Gödel avait informé Schilpp, le 2 février 1959, qu'il renonçait à l'envoi de l'article, dont il avait composé, surtout en 1954–1955, plusieur s versions sous le titre «Is Mathematics Syntax of Language?» Pour expliquer cet abandon, Wang avance les raisons suivantes: En premier lieu, Gödel était bien convaincu d'avoir réfuté la thése syntaxique, mais il n'était pas satisfait de son argumentation en faveur du platonisme. Deuxiémement, les critiques de Gödel s'adressent aux théses soutenues par Carnap en 1934 plutôt qu'à celles que ce dernier défendra vingt ans aprés, et qui paraissent moins hostiles au platonisme de son interlocuteur. II pouvait paraître douteux, en troisieme lieu, que Carnap ait eu le temps de rédiger, en 1959, la réponse qu'il aurait du faire, conformément aux régies de la collection, à Gödel. Or, en 1943 déjà, Gödel avait voulu retirer sa contribution au volume consacré à Russell dans la même serie, parce que ce dernier n'avait pu répondre à l'article de Gödel dont la rédaction lui avait été communiquée trop tardivement. (shrink)

A survey of current evidence available concerning Wittgenstein's attitude toward, and knowledge of, Gödel's first incompleteness theorem, including his discussions with Turing, Watson and others in 1937–1939, and later testimony of Goodstein and Kreisel; 2) Discussion of the philosophical and historical importance of Wittgenstein's attitude toward Gödel's and other theorems in mathematical logic, contrasting this attitude with that of, e.g., Penrose; 3) Replies to an instructive criticism of my 1995 paper by Mark Steiner which assesses the importance of Tarski's semantical (...) work, both for our understanding of Wittgenstein's remarks on Gödel, and our understanding of Gödel's theorem itself. (shrink)

The concept of the (full) unfolding of a schematic system is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted ? The program to determine for various systems of foundational significance was previously carried out for a system of nonfinitist arithmetic, ; it was shown that is proof-theoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system (...) of finitist arithmetic, , and for an extension of that by a form of the so-called Bar Rule. It is shown that and are proof-theoretically equivalent, respectively, to Primitive Recursive Arithmetic, , and to Peano Arithmetic,. (shrink)