Formalism in Mathematics

Gentzen's three consistency proofs for elementary number theory have a common aim that originates from Hilbert's Program, namely, the aim to justify the application of classical reasoning to quantified propositions in elementary number theory. In addition to this common aim, Gentzen gave a “finitist” interpretation to every number-theoretic proposition with his 1935 and 1936 consistency proofs. In the present paper, we investigate the relationship of this interpretation with intuitionism in terms of the debate between the Hilbert School and the Brouwer (...) School over the significance of consistency proofs. First, we argue that the interpretation had the role of responding to a Brouwer-style objection against the significance of consistency proofs. Second, we propose a way of understanding Gentzen's response to this objection from an intuitionist perspective. (shrink)

Critical study of Michael Potter, Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Oxford University Press, Oxford, 2000. x + 305 pages.

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.

The formalist philosophy of mathematics (in its purest, most extreme version) is widely regarded as a “discredited position”. This pure and extreme version of formalism is called by some authors “game formalism”, because it is alleged to represent mathematics as a meaningless game with strings of symbols. Nevertheless, I would like to draw attention to some arguments in favour of game formalism as an appropriate philosophy of real mathematics. For the most part, these arguments have not yet been used or (...) were neglected in past discussions. (shrink)

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes such terms (...) from a formal proof. The procedures by which this is to be carried out are based on Hilbert's epsilon substitution method. The epsilon calculus, however, has applications in other contexts as well. The first general application of the epsilon calculus was in Hilbert's epsilon theorems, which in turn provide the basis for the first correct proof of Herbrand's theorem. More recently, variants of the epsilon operator have been applied in linguistics and linguistic philosophy to deal with anaphoric pronouns. (shrink)

David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

This study aims to find out how high the level and trends of student misconceptions experienced by high school students in Indonesia. The subject of research that is a class XI student of Natural Science (IPA) SMA Negeri 1 Anjatan with the subject matter limit function. Forms of research used in this study is a qualitative research, with a strategy that is descriptive qualitative research. The data analysis focused on the results of the students' answers on the test essay subject (...) matter limit function with the number of students by 16 (sixteen). Data collection techniques used are shaped test methods essay, interview method to students who have misconceptions, and methods of documentation of the test answers. Examination of the validity of the data using a triangulation technique that compares the data written test results with data from interviews. The results of this study can be described as follows; (1) The level of misconceptions experienced by students belonging to the category of low, amounting to 12.18%. However, students who do not understand the concept quite high at 40.38%, and the others are students who understand the concept that is equal to 47.44%. (2) The misconception most experienced students lie in subconcepts explain the meaning of limit function at one point through the calculation of values around that point, that is equal to 20.51%. The tendency misconceptions experienced by students is located on errors and operating concepts that misconceptions students that there should be no limit in the completion of the writing of the emblem and misconceptions about the limit students to conclude if the limit value of 0 is no limit to the value of the function. (shrink)

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 article develops a critical investigation of the epistemological core of Hilbert's foundational project, the so-called the finitary attitude. The investigation proceeds by distinguishing different senses of 'number' and 'finitude' that have been used in the philosophical arguments. The usual notion of modern pure mathematics, i.e. the sense of number which is implicit in the notion of an arbitrary finite sequence and iteration is one sense of number and finitude. Another sense, of older origin, is connected with practices of counting (...) concrete things, and a third sense is linked up with the immediate intuitive experience of multitudes of concrete things. Hilbert's fìnitism is examined with respect to these differences, and it will be shown that there is a tendency to conflate the different senses of number and fìnitude, a tendency which has been a source of problems in the discussion of the foundations of mathematics and in the philosophy of logic and language. (shrink)

The background to the development of proof theory since 1960 is contained in the article (MATHEMATICS, FOUNDATIONS OF), Vol. 5, pp. 208- 209. Brie y, Hilbert's program (H.P.), inaugurated in the 1920s, aimed to secure the foundations of mathematics by giving nitary consistency proofs of formal systems such as for number theory, analysis and set theory, in which informal mathematics can be represented directly. These systems are based on classical logic and implicitly or explicitly depend on the assumption of \completed (...) in nite" totalities. Consistency of a system S (containing a modicum of elementary number theory) is su cient to ensure that any nitary meaningful statement about the natural numbers which is provable in S is correct under the intended interpretation. Thus, in Hilbert's view, consistency of S would serve to eliminate the \completed in nite" in favor of the \potential in nite" and thus secure the body of mathematics represented in S. Hilbert established the subject of proof theory as a technical part of mathematical logic by means of which his program was to be carried out its methods will be described below. In 1931, Godel's second incompleteness theorem raised a prima facieobstacle to H.P. for the system Z of elementary number theory (also called Peano Arithmetic, and denoted below by PA) since all previously recognized forms of nitary reasoning could be formalized within it. In any case, Hilbert's program could not possibly succeed for any system such as set theory in which all nitary notions and reasoning could unquestionably be formalized. These obstacles led workers in proof theory to modify H.P. in two kinds of ways. The rst was to seek reductions of various formal systems S to more constructive systems S 0. The second was to shift the aims from foundational ones to more mathematical ones. Examples of 1 the former move are the reductions of PA to intuitionistic arithmetic HA, and Gentzen's consistency proof of PA by nitary reasoning coupled with quanti er-free trans nite induction up to the ordinal , TI( 0), both obtained in the 1930s (cf.. (shrink)

The theory that ``consistency implies existence'' was put forward by Hilbert on various occasions around the start of the last century, and it was strongly and explicitly emphasized in his correspondence with Frege. Since (Gödel's) completeness theorem, abstractly speaking, forms the basis of this theory, it has become common practice to assume that Hilbert took for granted the semantic completeness of second order logic. In this paper I maintain that this widely held view is untrue to the facts, and that (...) the clue to explain what Hilbert meant by linking together consistency and existence is to be found in the role played by the completeness axiom within both geometrical and arithmetical axiom systems. (shrink)

In this thesis, I discuss the philosophical foundations of Hilbert's Consistency Programme of the 1920's, in the light of the incompleteness theorems of Godel. ;I begin by locating the Consistency Programme within Hilbert's broader foundational project. I show that Hilbert's main aim was to establish that classical mathematics, and in particular classical analysis, is a conservative extension of finitary mathematics. Accepting the standard identification of finitary mathematics with primitive recursive arithmetic, and classical analysis with second order arithmetic, I report upon (...) some recent work which shows that Hilbert's aim can almost be realized. ;I then discuss the philosophical significance of this startling fact. I describe Hilbert as seeking a middle way between two mathematically revisionary positions in the philosophy of mathematics--a kind of proto-intuitionism, and an extreme realism, associated with the views of Kronecker and Frege respectively. I outline a Hilbertian alternative to these positions. The result is a moderate realism that owes much to Quine. I defend it against certain objections, and display its virtues in a series of comparisons with alternatives currently influential in the literature. ;In Chapter Two, I discuss the special status the Hilbertian gives to finitary mathematics. I argue that two ways of justifying this special status--by claiming that finitary mathematics is ontologically special, since it is committed only to expressions, and by claiming that finitary mathematics is epistemologically special, since its results are especially evident--are in fact hopeless. I then defend an alternative justification, drawing in part on Godel's well known discussion of mathematical intuition. ;In Chapter Three, I discuss the implications of incompleteness for the Hilbertian philosophy of mathematics. I argue, against some recent work by Michael Detlefsen, that the incompleteness theorems show definitively that Hilbert's Programme cannot be carried out in full generality. Drawing on recent work by Warren Goldfarb, I show that this conclusion follows from the First Incompleteness Theorem, and can be established without any controversial appeal to the semantic value of undecidable sentences. However, I argue that the fact of incompleteness adds to, rather than detracts from, the attractiveness of the basic Hilbertian position on the nature of mathematics. (shrink)

We show that a statement HIL, which is motivated by a lemma of Hilbert and close in formulation to Hindman’s theorem, is actually much weaker than Hindman’s theorem. In particular, HIL is finitistically reducible in the sense of Hilbert’s program, while Hindman’s theorem is not.

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 ...

In the article, philosophical and methodological analysis of the program of Hilbert’s formalism as a really working direction for consideration of the bases of modern mathematics is presented. For the professional mathematicians methodological advantages of the program of formalism advanced by David Hilbert, consist primarily in the fact that the highest possible level of theoretical rigor of modern mathematical theories was practically represented there. To resolve the fundamental difficulties of the problem of bases of mathematics, according to Hilbert, the theory (...) of mathematical proof is needed, but contrary to popular belief rigorous formalization of the proof is not a synonym of reliability and rigor of mathematical reasoning from the point of view of the philosophy of the foundations of mathematics. In fact, the consistency of the theories is "more important" than their logical consistency because not every statement, which does not contradict to the reasonable ones, can be attributed to a true statement. However, for working mathematicians, Hilbert is logical and consistent and the axiomatic method and formalism are an essential part of their rules of thinking. (shrink)

Most scholars think of David Hilbert's program as the most demanding and ideologically motivated attempt to provide a foundation for mathematics, and because they see technical obstacles in the way of realizing the program's goals, they regard it as a failure. Against this view, Curtis Franks argues that Hilbert's deepest and most central insight was that mathematical techniques and practices do not need grounding in any philosophical principles. He weaves together an original historical account, philosophical analysis, and his own development (...) of the meta-mathematics of weak systems of arithmetic to show that the true philosophical significance of Hilbert's program is that it makes the autonomy of mathematics evident. The result is a vision of the early history of modern logic that highlights the rich interaction between its conceptual problems and technical development. (shrink)

After sketching the main lines of Hilbert's program, certain well-known and influential interpretations of the program are critically evaluated, and an alternative interpretation is presented. Finally, some recent developments in logic related to Hilbert's program are reviewed.

Filtration combustion is described by Laplacian growth without surface tension. These equations have elegant analytical solutions that replace the complex integro-differential motion equations by simple differential equations of pole motion in a complex plane. The main problem with such a solution is the existence of finite time singularities. To prevent such singularities, nonzero surface tension is usually used. However, nonzero surface tension does not exist in filtration combustion, and this destroys the analytical solutions. However, a more elegant approach exists for (...) solving the problem. First, we can introduce a small amount of pole noise to the system. Second, for regularisation of the problem, we throw out all new poles that can produce a finite time singularity. It can be strictly proved that the asymptotic solution for such a system is a single finger. Moreover, the qualitative consideration demonstrates that a finger with 1 2 of the channel width is statistically stable. Therefore, all properties of such a solution are exactly the same as those of the solution with nonzero surface tension under numerical noise. The solution of the ST problem without surface tension is similar to the solution for the equation of cellular flames in the case of the combustion of gas mixtures. (shrink)

A comprehensive historical overview of formalist ideas in the philosophy of mathematics.

We consider a seemingly popular justification (we call it the Re-flexivity Defense) for the third derivability condition of the Hilbert-Bernays-Löb generalization of Godel's Second Incompleteness Theorem (G2). We argue that (i) in certain settings (rouglily, those where the representing theory of an arithmetization is allowed to be a proper subtheory of the represented theory), use of the Reflexivity Defense to justify the tliird condition induces a fourth condition, and that (ii) the justification of this fourth condition faces serious obstacles. We (...) conclude that, in the types of settings mentioned, the Reflexivity Defense does not justify the usual ‘reading’ of G2—namely, that the consistency of the represented theory is not provable in the representing theory. (shrink)

It is a commonplace of constructivist thought that a claim that an object of a certain kind exists is to be backed by an explicit display or exhibition of an object that is manifestly of that kind. Let us refer to this requirement as the exhibition condition. The main objective of this essay is to examine this requirement and to arrive at a better understanding of its epistemic character and the role that it plays in the two main constructivist philosophies (...) of this century---the intuitionist programme of Brouwer and Weyl, and the finitist programme of Hilbert. (shrink)

Various parallels between Kant's critical program and Hilbert's formalistic program for the philosophy of mathematics are considered.

It is argued that an instrumentalist notion of proof such as that represented in Hilbert's viewpoint is not obligated to satisfy the conservation condition that is generally regarded as a constraint on Hilbert's Program. A more reasonable soundness condition is then considered and shown not to be counter-exemplified by Godel's First Theorem. Finally, attention is given to the question of what a theory is; whether it should be seen as a "list" or corpus of beliefs, or as a method for (...) selecting beliefs. The significance of this question for assessing "intensional" results like Godel's Second Theorem, and their bearing on Hilbert's Program are discussed. (shrink)

In this paper I have considered various attempts to attribute significance to Gödel's second incompleteness theorem (G2 for short). Two of these attempts (Beth-Cohen and the position maintaining that G2 shows the failure of Hilbert's Program), I have argued, are false. Two others (an argument suggested by Beth, Cohen and ??? and Resnik's Interpretation), I argue, are groundless.

This monograph explores several classical issues of modern mathematics, and discusses both the historical and research aspects. The brief historical part is focused on Riemann’s zeta function and few related problems. The research part starts from direct formulation of simple proofs of both the prime number theorem and Riemann’s hypothesis, two intriguing problems of modern mathematics, which applies the concept of Mertens’s function and is based on Apostol’s and Littlewood’s criterions of equivalence. The second research problem discussed in this book (...) is distribution of prime numbers. Elementary derivation of the explicit formulae for both the prime-counting function and Riemann’s weighted-prime counting function, based on the technique of Mellin’s transform, is presented in some detail. As the third research problem, the binomial regularization of Riemann’s zeta function is introduced. Finally, as the additional research problem, the derivation of the number of partitions of a positive integer into a finite number of positive integer summands, based on Hardy–Ramanujan–Rademacher’s formula, is presented in some detail. The monograph is helpful for the mathematicians working in number theory, combinatorics, mathematical analysis, function theory, and their applications. Also, it can be a higher-level introduction for students starting their work in these branches of mathematics. -/- Contents Foreword 1 Brief Historical Overview 1 Riemann’s Zeta Function 2 Mertens’s Conjecture 3 Prime Number Theorem 2 Prime Number Theorem & Riemann’s Hypothesis 3 Distribution of Prime Numbers 4 Binomial Regularization 5 Addendum: Integer Partitions Bibliography Index. (shrink)

It has been contended that it is unjustified to believe, as Weyl did, that formalism's victory against intuitionism entails a defeat of the phenomenological approach to mathematics. The reason for this contention, recently put forth by Paolo Mancosu and Thomas Ryckman, is that, unlike intuitionistic Anschauung, phenomenological intuition could ground classical mathematics. I argue that this indicates a misinterpretation of Weyl's view, for he did not take formalism to prevail over intuitionism with respect to grounding classical mathematics. I also point (...) out that the contention is false: if intuitionism fails, in the way Weyl thought it did, i.e., with respect to supporting scientific objectivity, then one should also reject the phenomenological approach, in the same respect. (shrink)

The period in the foundations of mathematics that started in 1879 with the publication of Frege's Begriffsschrift and ended in 1931 with Gödel's Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I can reasonably be called the classical period. It saw the development of three major foundational programmes: the logicism of Frege, Russell and Whitehead, the intuitionism of Brouwer, and Hilbert's formalist and proof-theoretic programme. In this period, there were also lively exchanges between the various schools culminating in (...) the famous Hilbert-Brouwer controversy in the 1920s. -/- The purpose of this anthology is to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. What can we say, in retrospect, about the various foundational programmes of the classical period and the disputes that took place between them? To what extent do the classical programmes of logicism, intuitionism and formalism represent options that are still alive today? These questions are addressed in this volume by leading mathematical logicians and philosophers of mathematics. (shrink)

Truth Through Proof defends an anti-platonist philosophy of mathematics derived from game formalism. Alan Weir aims to develop a more satisfactory successor to game formalism utilising a widely accepted, broadly neo-Fregean framework, in which the proposition expressed by an utterance is a function of both sense and background circumstance.

Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert (...) probably thought that he had completed the philosophical part of his program, maybe up to a few details. What was left to do was the technical part. To carry it out one, roughly, had to give a precise axiomatization of mathematics and show that it is consistent on purely finitistic grounds. This would come down to giving a relative consistency proof of mathematics in finitist mathematics, or to give a proof-theoretic reduction of mathematics on to finitist mathematics (we will look at these notions in more detail soon). It is widely believed that Gödel’s theorems showed that the technical part of Hilbert’s program could not be carried out. Gödel’s theorems show that the consistency of arithmetic can not even be proven in arithmetic, not to speak of by finitistic means alone. So, the technical part of Hilbert’s program is hopeless, and since Hilbert’s program essentially relied on both the technical and the philosophical part, Hilbert’s program as a whole is hopeless. Justified as this attitude is, it is a bit unfortunate. It is unfortunate because it takes away too much attention from the philosophical part of Hilbert’s program. And this is unfortunate for two reasons. (shrink)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent (in an informal sense) and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

It is shown that David Hilbert's formalistic approach to axiomaticis accompanied by a certain pragmatism that is compatible with aphilosophical, or, so to say, external foundation of mathematics.Hilbert's foundational programme can thus be seen as areconciliation of Pragmatism and Apriorism. This interpretation iselaborated by discussing two recent positions in the philosophy ofmathematics which are or can be related to Hilbert's axiomaticalprogramme and his formalism. In a first step it is argued that thepragmatism of Hilbert's axiomatic contradicts the opinion thatHilbert style (...) axiomatical systems are closed systems, a reproachposed by Carlo Cellucci. In the second section the question isdiscussed whether Hilbert's pragmatism in foundational issuescomes close to an a-philosophical ``naturalism in mathematics'' assuggested by Penelope Maddy. The answer is ``no'', because forHilbert philosophy had its specific tasks in the general projectto found mathematics. This is illuminated in the concludingsection giving further evidence for Hilbert's foundationalapriorism by discussing his ``axiom of the existence of mind'' andrelating it to the ``one and only axiom'' of the German algebraistof logic, Ernst Schröder, postulating the inherence of signs onthe paper. (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.

Detlefsen (1986) reads Hilbert's program as a sophisticated defense of instrumentalism, but Feferman (1998) has it that Hilbert's program leaves significant ontological questions unanswered. One such question is of the reference of individual number terms. Hilbert's use of admittedly "meaningless" signs for numbers and formulae appears to impair his ability to establish the reference of mathematical terms and the content of mathematical propositions (Weyl (1949); Kitcher (1976)). The paper traces the history and context of Hilbert's reasoning about signs, which illuminates (...) Hilbert's account of mathematical objectivity, axiomatics, idealization, and consistency. (shrink)

Formalism shares with nominalism a distaste for abstracta. But an honest exposition of the former position risks introducing abstracta as the stuff of syntax. This article describes the dangers, and offers a new escape route from platonism for the formalist. It is explained how the needed role of derivations in mathematical practice can be explained, not by a commitment to the derivations themselves, but by the commitment of the mathematician to a practice which is in accord with a theory of (...) derivations. (shrink)

In "Material Implications" (1992), mathematical discourse was said to be different from ordinary discourse, with the discussion centering around conditionals. This paper shows how.

The guiding idea behind formalism is that mathematics is not a body of propositions representing an abstract sector of reality but is much more akin to a game, bringing with it no more commitment to an ontology of objects or properties than ludo or chess. This idea has some intuitive plausibility: consider the tyro toiling at multiplication tables or the student using a standard algorithm for differentiating or integrating a function. It also corresponds to some aspects of the practice of (...) advanced mathematicians in some periods—for example, the treatment of imaginary numbers for some time after Bombelli's introduction of them, and perhaps the attitude of some contemporary mathematicians towards the higher flights of set theory. Finally, it is often the position to which philosophically naïve respondents will gesture towards, when pestered by questions as to the nature of mathematics. (shrink)

In a recent article, Azzouni has argued in favor of a version of formalism according to which ordinary mathematical proofs indicate mechanically checkable derivations. This is taken to account for the quasi-universal agreement among mathematicians on the validity of their proofs. Here, the author subjects these claims to a critical examination, recalls the technical details about formalization and mechanical checking of proofs, and illustrates the main argument with aanalysis of examples. In the author's view, much of mathematical reasoning presents genuine (...) meaning-dependent mathematical characteristics that cannot be captured by formal calculi. ‘…there is a conflict between mathematical practice and the formalist doctrine.’ [Kreisel, 1969, p. 39]. (shrink)