The twentieth century has witnessed an unprecedented 'crisis in the foundations of mathematics', featuring a world-famous paradox (Russell's Paradox), a challenge to 'classical' mathematics from a world-famous mathematician (the 'mathematical intuitionism' of Brouwer), a new foundational school (Hilbert's Formalism), and the profound incompleteness results of Kurt Gödel. In the same period, the cross-fertilization of mathematics and philosophy resulted in a new sort of 'mathematical philosophy', associated most notably (but in different ways) with Bertrand Russell, W. V. Quine, and Gödel himself, (...) and which remains at the focus of Anglo-Saxon philosophical discussion. The present collection brings together in a convenient form the seminal articles in the philosophy of mathematics by these and other major thinkers. It is a substantially revised version of the edition first published in 1964 and includes a revised bibliography. The volume will be welcomed as a major work of reference at this level in the field. (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 fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for ...

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)

This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This clarifies the (...) nature of the equivalence of PA and ZF−inf and corrects some errors in the literature. We also survey the restrictions of the Ackermann interpretation and its inverse to subsystems of PA and ZF−inf, where full induction, replacement, or separation is not assumed. The paper concludes with a discussion on the problems one faces when the totality of exponentiation fails, or when the existence of unordered pairs or power sets is not guaranteed. (shrink)

The problem of absolute generality has attracted much attention in recent philosophy. Agustin Rayo and Gabriel Uzquiano have assembled a distinguished team of contributors to write new essays on the topic. They investigate the question of whether it is possible to attain absolute generality in thought and language and the ramifications of this question in the philosophy of logic and mathematics.

Charles Parsons; X*—Mathematical Intuition, Proceedings of the Aristotelian Society, Volume 80, Issue 1, 1 June 1980, Pages 145–168, https://doi.org/10.1093/ari.

Charles Parsons has argued that we have the ability to apprehend, or "intuit", certain kinds of abstract objects; that among the objects we can intuit are some which form a model for arithmetic; and that our knowledge that the axioms of arithmetic are true in this model involves our intuition of these objects. I find a problem with Parson's claim that we know this model is infinite through intuition. Unless this problem can be resolved. I question whether our knowledge that (...) the arithmetical axioms are true can reasonably be called intuitive in the way Parsons intends. (shrink)

At the same time, the book is a contribution to recent philosophical debates, in particular on the prospects for a successful nominalist reconstruction of .

Hilbert's program attempts to show that our mathematical knowledge can be certain because we are able to know for certain the truths of elementary arithmetic. I argue that, in the absence of a theory of mathematical truth, Hilbert does not have a complete theory of our arithmetical knowledge. Further, while his deployment of a Kantian notion of intuition seems to promise an answer to scepticism, there is no way to complete Hilbert's epistemology which would answer to his avowed aims.

In the first part of this paper we discuss some aspects of Detlefsen's attempt to save Hilbert's Program from the consequences of Godel's Second Incompleteness Theorem. His arguments are based on his interpretation of the long standing and well-known controversy on what, exactly, finitistic means are. In his paper [1] Detlefsen takes the position that there is a form of the ω-rule which is a finitistically valid means of proof, sufficient to prove the consistency of elementary number theory Z. On (...) the other hand, he claims that Z with its first-order logic is not strong enough to allow a formalization of such an ω-rule. This would explain why the unprovability of $\operatorname{Con}(Z)$ in Z does not imply that the consistency of Z cannot be proved by finitistic means. We show that Detlefsen's proposal is unacceptable as originally formulated in [1], but that a reasonable modification of the rule he suggest leads to a partial program already studied for many years. We investigate the scope of such a program in terms of proof-theoretic reducibilities. We also show that this partial program encompasses mathematically important theories studied in the "Reverse Mathematics" program. In order to investigate the provability with such a modified rule, we define new consistency and provability predicates which are weaker than the usual ones. We then investigate their properties, including a few that have no apparent philosophical significance but compare interestingly with the properties of the program based on the iteration of our ω-rule. We determine some of the limitations of such programs, pointing out that these limitations partly explain why partial programs that have been successfully carried out use quite different and substantially more radical extensions of finitistic methods with more general forms of restricted reasoning. (shrink)

Die Leitgedanken meiner Untersuchungen über die Grundlagen der Mathematik, die ich - anknüpfend an frühere Ansätze - seit 1917 in Besprechungen mit P. BERNAYS wieder aufgenommen habe, sind von mir an verschiedenen Stellen eingehend dargelegt worden. Diesen Untersuchungen, an denen auch W. ACKERMANN beteiligt ist, haben sich seither noch verschiedene Mathematiker angeschlossen. Der hier in seinem ersten Teil vorliegende, von BERNAYS abgefaßte und noch fortzusetzende Lehrgang bezweckt eine Darstellung der Theorie nach ihren heutigen Ergebnissen. Dieser Ergebnisstand weist zugleich die Richtung (...) für die weitere Forschung in der Beweistheorie auf das Endziel hin, unsere üblichen Methoden der Mathematik samt und sonders als widerspruchsfrei zu erkennen. Im Hinblick auf dieses Ziel möchte ich hervorheben, daß die zeit weilig aufgekommene Meinung, aus gewissen neueren Ergebnissen von GÖDEL folge die Undurchführbarkeit meiner Beweistheorie, als irrtüm lich erwiesen ist. Jenes Ergebnis zeigt in der Tat auch nur, daß man für die weitergehenden Widerspruchsfreiheitsbeweise den finiten Stand punkt in einer schärferen Weise ausnutzen muß, als dieses bei der Be trachtung der elementaren Formallsmen erforderlich ist. Göttingen, im März 1934 HILBERT Vorwort zur ersten Auflage Eine Darstellung der Beweistheorie, welche aus dem HILBERTschen Ansatz zur Behandlung der mathematisch-logischen Grundlagenpro bleme erwachsen ist, wurde schon seit längerem von HILBERT ange kündigt. (shrink)

ZusammenfassungP. Bernays hat darauf hingewiesen, dass man, um die Widerspruchs freiheit der klassischen Zahlentheorie zu beweisen, den Hilbertschen flniter Standpunkt dadurch erweitern muss, dass man neben den auf Symbole sich beziehenden kombinatorischen Begriffen gewisse abstrakte Begriffe zulässt, Die abstrakten Begriffe, die bisher für diesen Zweck verwendet wurden, sinc die der konstruktiven Ordinalzahltheorie und die der intuitionistischer. Logik. Es wird gezeigt, dass man statt deesen den Begriff einer berechenbaren Funktion endlichen einfachen Typs über den natürlichen Zahler benutzen kann, wobei keine anderen (...) Konstruktionsverfahren für solche Funktionen nötig sind, als einfache Rekursion nach einer Zahlvariablen und Einsetzung von Funktionen ineinander .P. Bernays has pointed out that, in order to prove the consistency of classical number theory, it is necessary to extend Hilbert's finitary stand‐point by admitting certain abstract concepts in addition to the combinatorial concepts referring to symbols. The abstract concepts that so far have been used for this purpose are those of the constructive theory of ordinals and those of intuitionistic logic. It is shown that the concept of a computable function of finite simple type over the integers can be used instead, where no other procedures of constructing such functions are necessary except simple recursion by an integral variable and substitution of functions in each other. (shrink)

Finitism is given an interpretation based on two ideas about strings (sequences of symbols): a replacement principle extracted from Hilberts class 2 can be justified by means of an additional finitistic choice principle, thus obtaining a second equational theory . It is unknown whether is strictly stronger than since 2 may coincide with the class of lower elementary functions.

This article discusses Charles Parsons’ conception of mathematical intuition. Intuition, for Parsons, involves seeing-as: in seeing the sequences I I I and I I I as the same type, one intuits the type. The type is abstract, but intuiting the type is supposed to be epistemically analogous to ordinary perception of physical objects. And some non-trivial mathematical knowledge is supposed to be intuitable in this way, again in a way analogous to ordinary perceptual knowledge. In particular, the successor axioms are (...) supposed to be knowable intuitively.This conception has the resources to respond to some familiar objections to mathematical intuition. But the analogy to ordinary perception is weaker than it looks, and the warrant provided for non-trivial mathematical beliefs by intuition of this sort is weak too weak, perhaps, to yield any mathematical knowledge. (shrink)

This article discusses Charles Parsons’ conception of mathematical intuition. Intuition, for Parsons, involves seeing-as: in seeing the sequences I I I and I I I as the same type, one intuits the type. The type is abstract, but intuiting the type is supposed to be epistemically analogous to ordinary perception of physical objects. And some non-trivial mathematical knowledge is supposed to be intuitable in this way, again in a way analogous to ordinary perceptual knowledge. In particular, the successor axioms are (...) supposed to be knowable intuitively.This conception has the resources to respond to some familiar objections to mathematical intuition. But the analogy to ordinary perception is weaker than it looks, and the warrant provided for non-trivial mathematical beliefs by intuition of this sort is weak too weak, perhaps, to yield any mathematical knowledge. (shrink)

An Essay on Mathematical Instrumentalism M. Detlefsen. THE PHILOSOPHICAL FUNDAMENTALS OF HILBERT'S PROGRAM 1. INTRODUCTION In this chapter I shall attempt to set out Hilbert's Program in a way that is more revealing than ...

Dieser Buchtitel ist Teil des Digitalisierungsprojekts Springer Book Archives mit Publikationen, die seit den Anfängen des Verlags von 1842 erschienen sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.

From Brouwer To Hilbert: The Debate on the Foundations of Mathematics in the 1920s offers the first comprehensive introduction to the most exciting period in the foundation of mathematics in the twentieth century. The 1920s witnessed the seminal foundational work of Hilbert and Bernays in proof theory, Brouwer's refinement of intuitionistic mathematics, and Weyl's predicativist approach to the foundations of analysis. This impressive collection makes available the first English translations of twenty-five central articles by these important contributors and many others. (...) The articles have been translated for the first time from Dutch, French, and German, and the volume is divided into four sections devoted to (1) Brouwer, (2) Weyl, (3) Bernays and Hilbert, and (4) the emergence of intuitionistic logic. Each section opens with an introduction which provides the necessary historical and technical context for understanding the articles. Although most contemporary work in this field takes its start from the groundbreaking contributions of these major figures, a good, scholarly introduction to the area was not available until now. Unique and accessible, From Brouwer To Hilbert will serve as an ideal text for undergraduate and graduate courses in the philosophy of mathematics, and will also be an invaluable resource for philosophers, mathematicians, and interested non-specialists. (shrink)

This volume offers a selection of the most interesting and important work from recent years in the philosophy of mathematics, which has always been closely linked to, and has exerted a significant influence upon, the main stream of analytical philosophy. The issues discussed are of interest throughout philosophy, and no mathematical expertise is required of the reader. Contributors include W.V. Quine, W.D. Hart, Michael Dummett, Charles Parsons, Paul Benacerraf, Penelope Maddy, W.W. Tait, Hilary Putnam, George Boolos, Daniel Isaacson, Stewart Shapiro, (...) and Hartry Field. (shrink)

William Tait is one of the most distinguished philosophers of mathematics of the last fifty years. This volume collects his most important published philosophical papers from the 1980's to the present. The articles cover a wide range of issues in the foundations and philosophy of mathematics, including some on historical figures ranging from Plato to Gdel.

Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...

Charles Parsons examines the notion of object, with the aim to navigate between nominalism, denying that distinctively mathematical objects exist, and forms of Platonism that postulate a transcendent realm of such objects. He introduces the central mathematical notion of structure and defends a version of the structuralist view of mathematical objects, according to which their existence is relative to a structure and they have no more of a 'nature' than that confers on them. Parsons also analyzes the concept of intuition (...) and presents a conception of it distantly inspired by that of Kant, which describes a basic kind of access to abstract objects and an element of a first conception of the infinite. (shrink)

In his paper "Finitism", W.W. Tait maintains that the chief difficulty for everyone who wishes to understand Hilbert's conception of finitist mathematics is this: to specify the sense of the provability of general statements about the natural numbers without presupposing infinite totalities. Tait further argues that all finitist reasoning is essentially primitive recursive. In this paper, we attempt to show that his thesis "The finitist functions are precisely the primitive recursive functions" is disputable and that another, likewise defended by him, (...) is untenable. The second thesis is that the finitist theorems are precisely the universal closures of the equations that can be proved in PRA. /// En su articulo "Finitism", W.W. Tait sostiene que la dificultad principal para quien quiere comprender la concepción hilbertiana de la matemática finitista es ésta: especificar el sentido de la demostrabilidad de enunciados generales sobre los números naturales sin presuponer totalidades infinitas. Además, Tait argumenta que todo razonamiento finitista es esencialmente primitivo recursivo. En este artículo tratamos de mostrar que su tesis "Las funciones finitistas son precisamente las funciones primitivas recursivas" es discutible y que otra, también defendida por él, resulta insostenible. La segunda tesis es que los teoremas finitistas son precisamente las clausuras universales de las ecuaciones que pueden demostrarse en PRA. (shrink)

The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic, P RA; and in 1981, in “Finitism” [28], I expanded on the argument. But some recent discussions and some of the more recent literature on the subject lead me to think that a few further remarks would be useful.