In this paper we apply social epistemology to mathematical proofs and their role in mathematical knowledge. The most famous modern collaborative mathematical proof effort is the Classification of Finite Simple Groups. The history and sociology of this proof have been well-documented by Alma Steingart (2012), who highlights a number of surprising and unusual features of this collaborative endeavour that set it apart from smaller-scale pieces of mathematics. These features raise a number of interesting philosophical issues, but have received very little (...) attention. In this paper, we will consider the philosophical tensions that Steingart uncovers, and use them to argue that the best account of the epistemic status of the Classification Theorem will be essentially and ineliminably social. This forms part of the broader argument that in order to understand mathematical proofs, we must appreciate their social aspects. (shrink)

Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show that (...) diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

It is argued in this study that (i) progress in the philosophy of mathematical practice requires a general positive account of informal proof; (ii) the best candidate is to think of informal proofs as arguments that depend on their matter as well as their logical form; (iii) articulating the dependency of informal inferences on their content requires a redefinition of logic as the general study of inferential actions; (iv) it is a decisive advantage of this conception of logic that it (...) accommodates the many mathematical proofs that include actions on objects other than propositions; (v) this conception of logic permits the articulation of project-sized tasks for the philosophy of mathematical practice, thereby supplying a partial characterisation of normal research in the field. (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)

In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically impure (...) (ergodic) proof due to Furstenberg (Section 3). Furstenberg’s ergodic proof is striking because it utilizes intuitively foreign and infinitary resources to prove a finitary combinatorial result and does so in a perspicuous fashion. I claim that Furstenberg’s proof is explanatory in light of its clear expression of a crucial structural result, which provides the “reason why” Szemerédi’s theorem is true. This is, however, rather surprising: how can such intuitively different conceptual resources “get a grip on” the theorem to be proved? I account for this phenomenon by articulating a new construal of the content of a mathematical statement, which I call structural content (Section 4). I argue that the availability of structural content saves intuitive epistemic distinctions made in mathematical practice and simultaneously explicates the intervention of surprising and explanatorily rich conceptual resources. Structural content also disarms general arguments for thinking that impurity and explanatory power might come apart. Finally, I sketch a proposal that, once structural content is in hand, impure resources lead to explanatory proofs via suitably understood varieties of simplification and unification (Section 5). (shrink)

This paper proposes an account of why proof is the only way to acquire knowledge of some mathematical proposition’s truth. Admittedly, non-deductive arguments for mathematical propositions can be strong and play important roles in mathematics. But this paper proposes a necessary condition for knowledge that can be satisfied by putative proofs (and proof sketches), as well as by non-deductive arguments in science, but not by non-deductive arguments from mathematical evidence. The necessary condition concerns whether we can justly expect that if (...) the mathematical proposition is actually false, despite the evidence for its truth, then this fact has an explanation. (shrink)

Lately, philosophers of mathematics have been exploring the notion of mathematical explanation within mathematics. This project is supposed to be analogous to the search for the correct analysis of scientific explanation. I argue here that given the way philosophers have been using “ explanation,” the term is not applicable to mathematics as it is in science.

A key question of the ‘maverick’ tradition of the philosophy of mathematical practice is addressed, namely what is mathematical progress. The investigation is based on an article by Penelope Maddy devoted to this topic in which she considers only contributions ‘of some mathematical importance’ as progress. With the help of a case study from contemporary mathematics, more precisely from tropical geometry, a few issues with her proposal are identified. Taking these issues into consideration, an alternative account of ‘mathematical importance’, broadly (...) within the framework of progress Maddy offers, is developed with a special focus on mathematicians’ peer-review practice. (shrink)

Many mathematicians have cited depth as an important value in their research. However, there is no single widely accepted account of mathematical depth. This article is an attempt to bridge this gap. The strategy is to begin with a discussion of Szemerédi's theorem, which says that each subset of the natural numbers that is sufficiently dense contains an arithmetical progression of arbitrary length. This theorem has been judged deep by many mathematicians, and so makes for a good case on which (...) to focus in analyzing mathematical depth. After introducing the theorem, four accounts of mathematical depth will be considered. (shrink)

There are lots of arguments for, or justifications of, mathematical theorems that make use of principles from physics. Do any of these constitute explanations? On the one hand, physical principles do not seem like they should be explanatorily relevant; on the other, some particular examples of physical justifications do look explanatory. In this article, I defend the idea that physical justifications can and do explain mathematical facts. 1 Physical Arguments for Mathematical Truths2 Preview3 Mathematical Facts4 Purity5 Doubts about Purity: I6 (...) Doubts about Purity: II7 How Physical Arguments Might Explain: I8 How Physical Arguments Might Explain: II9 Conclusion. (shrink)

In this article, we report a study in which 109 research-active mathematicians were asked to judge the validity of a purported proof in undergraduate calculus. Significant results from our study were as follows: (a) there was substantial disagreement among mathematicians regarding whether the argument was a valid proof, (b) applied mathematicians were more likely than pure mathematicians to judge the argument valid, (c) participants who judged the argument invalid were more confident in their judgments than those who judged it valid, (...) and (d) participants who judged the argument valid usually did not change their judgment when presented with a reason raised by other mathematicians for why the proof should be judged invalid. These findings suggest that, contrary to some claims in the literature, there is not a single standard of validity among contemporary mathematicians. (shrink)

Although in the past three decades interest in mathematical explanation revived, recent literature on the subject seems to neglect the strict connection between explanation and discovery. In this paper I sketch an alternative approach that takes such connection into account. My approach is a revised version of one originally considered by Descartes. The main difference is that my approach is in terms of the analytic method, which is a method of discovery prior to axiomatized mathematics, whereas Descartes’s approach is in (...) terms of the analytic–synthetic method, which is a heuristic pattern in already axiomatized mathematics. (shrink)

Mathematicians use the word ‘deep’ to convey a high appreciation of a concept, theorem, or proof. This paper investigates the extent to which the term can be said to have an objective character by examining its first use in mathematics. It was a consequence of Gauss's work on number theory and the agreement among his successors that specific parts of Gauss's work were deep, on grounds that indicate that depth was a structural feature of mathematics for them. In contrast, French (...) mathematicians had a less structural, more problem-oriented approach to mathematics and did not speak of depth so readily. (shrink)

Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer.

In recent years, substructural approaches to paradoxes have become quite popular. But whatever restrictions on structural rules we may want to enforce, it is highly desirable that such restrictions be accompanied by independent philosophical motivation, not directly related to paradoxes. Indeed, while these recent developments have shed new light on a number of issues pertaining to paradoxes, it seems that we now have even more open questions than before, in particular two very pressing ones: what (independent) motivations do we have (...) (if any) for restrictions on structural rules, and what to make of the plurality of new logics emerging from these restrictions, i.e. how to ‘choose’ among the different options. In this paper, we address these two questions from the perspective of a dialogical conception of logic that we've been advocating in recent years. We will argue that dialogical interpretations of structural rules, that is, as rules determining specific properties of the dialogues in question, provide a conveniently neutral framework to adjudicate between the different substructural proposals that have been made in the literature on paradoxes. (shrink)

A cornerstone of modern mathematical logic is the diagonal lemma of Gödel and Carnap. It is used in e.g. the classical proofs of the theorems of Gödel, Rosser and Tarski. From its first explication in 1934, just essentially one proof has appeared for the diagonal lemma in the literature; a proof that is so tricky and hard to relate that many authors have tried to avoid the lemma altogether. As a result, some so called diagonal-free proofs have been given for (...) the above mentioned fundamental theorems of logic. In this paper, we provide new proofs for the semantic formulation of the diagonal lemma, and for a weak version of the syntactic formulation of it. (shrink)

One of the central aims of the philosophical analysis of mathematical explanation is to determine how one can distinguish explanatory proofs from non-explanatory proofs. In this paper, I take a closer look at the current status of the debate, and what the challenges for the philosophical analysis of explanatory proofs are. In order to provide an answer to these challenges, I suggest we start from analysing the concept understanding. More precisely, I will defend four claims: understanding is a condition for (...) explanation, unificatory understanding is a type of explanatory understanding, unificatory understanding is valuable in mathematics, and mathematical proofs can contribute to unificatory understanding. As a result, in a context where the epistemic aim is to unify mathematical results, I argue it is fruitful to make a distinction between proofs based on their explanatory value. (shrink)

Monsters lurk within mathematical as well as literary haunts. I propose to trace some pathways between these two monstrous habitats. I start from Jeffrey Jerome Cohen’s influential account of monster culture and explore how well mathematical monsters fit each of his seven theses. The mathematical monsters I discuss are drawn primarily from three distinct but overlapping domains. Firstly, late nineteenth-century mathematicians made numerous unsettling discoveries that threatened their understanding of their own discipline and challenged their intuitions. The great French mathematician (...) Henri Poincaré characterised these anomalies as ‘monsters’, a name that stuck. Secondly, the twentieth-century philosopher Imre Lakatos composed a seminal work on the nature of mathematical proof, in which monsters play a conspicuous role. Lakatos coined such terms as ‘monster-barring’ and ‘monster-adjusting’ to describe strategies for dealing with entities whose properties seem to falsify a conjecture. Thirdly, and most recently, mathematicians dubbed the largest of the sporadic groups ‘the Monster’, because of its vast size and uncanny properties, and because its existence was suspected long before it could be confirmed. (shrink)

Purity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the notions of surrogate ontological content and structural content. From there, we characterize which (classical) first-order natural deduction proofs (...) of a mathematical theorem are pure. Formal proofs that refer to the ontological content of a theorem will be called ‘fully ontologically pure’. Formal proofs that refer to a surrogate ontological content of a theorem will be called ‘secondarily ontologically pure’, because they preserve the structural content of a theorem. We will use interpretations between theories to develop a proof-theoretic criterion that guarantees secondary ontological purity for formal proofs. (shrink)

In this study, several proofs of the compactness theorem for propositional logic with countably many atomic sentences are compared. Thereby some steps are taken towards a systematic philosophical study of the compactness theorem. In addition, some related data and morals for the theory of mathematical explanation are presented.

Just as mathematics helps us to represent and reason about the natural world, in its internal applications one branch of mathematics helps us to represent and reason about the subject matter of another. Recognition of the close analogy between internal and external applications of mathematics can help resolve two persistent philosophical puzzles concerning its applicability: a platonist puzzle arising from the abstractness of mathematical objects; and an empiricist puzzle arising from mathematical propositions’ lack of empirical factual content. In order to (...) see how this is the case, we will examine what it is to apply mathematics internally and describe examples. (shrink)

Une preuve est pure si, en gros, elle ne réfère dans son développement qu’à ce qui est « proche » de, ou « intrinsèque » à l’énoncé à prouver. L’infinité des nombres premiers, un théorème classique de l’arithmétique, est un cas d’étude particulièrement riche pour les recherches philosophiques sur la pureté. Deux preuves différentes de ce résultat sont ici considérées, à savoir la preuve euclidienne classique et une preuve « topologique » plus récente proposée par Furstenberg. D’un point de vue (...) naïf, il semblerait que la première soit pure et la seconde impure. Des objections à cette vue naïve sont ici considérées et réfutées. Concernant la preuve euclidienne, la question relève de la logique, notamment de la définissabilité arithmétique de l’addition en termes de successeur et de divisibilité telle que démontrée par Julia Robinson, tandis qu’en ce qui concerne la preuve topologique, la question relève de la sémantique, notamment pour tout ce qui touche au problème de savoir ce qui est « inclus » dans le contenu d’énoncés particuliers.A proof is pure, roughly, if it draws only on what is « close » or « intrinsic » to the statement being proved. The infinitude of prime numbers, a classical theorem of arithmetic, is a rich case study for philosophical investigation of purity. Two different proofs of this result are considered, namely the classical Euclidean proof and a more recent « topological » proof by Furstenberg. Naively the former would seem to be pure and the latter to be impure. Objections to these naive views are considered and met. In the case of the former the issue rests on logical matters, specifically the arithmetic definability of addition in terms of successor and divisibility shown by Julia Robinson, while in the case of the latter the issue rests on semantic matters, specifically with respect to what is « contained » in the content of particular statements. (shrink)

It is usually accepted that deductions are non-informative and monotonic, inductions are informative and nonmonotonic, abductions create hypotheses but are epistemically irrelevant, and both deductions and inductions can’t provide new insights. In this article, I attempt to provide a more cohesive view of the subject with the following hypotheses: (1) the paradigmatic examples of deductions, such as modus ponens and hypothetical syllogism, are not inferential forms, but coherence requirements for inferences; (2) since any reasoner aims to be coherent, any inference (...) must be deductive; (3) a coherent inference is an intuitive process where the premises should be taken as sufficient evidence for the conclusion, which on its turn should be viewed as necessary evidence for the premises in some modal range; (4) inductions, properly understood, are abductions, but there are no abductions beyond the fact that in any inference the conclusion should be regarded as necessary evidence for the premises; (5) monotonicity is not only compatible with the retraction of past inferences given new information, but it is a requirement for it; (6) this explanation of inferences holds true for discovery processes, predictions and trivial inferences. (shrink)

In the philosophy of mathematical practice, the aim is to understand the various aspects of this practice. Even though definitions are a central element of mathematical practice, the study of this aspect of mathematical practice is still in its infancy. In particular, there is little empirical evidence to substantiate claims about definitions in practice. In this article, we address this gap by reporting on an empirical investigation on how mathematicians create definitions and which roles and properties they attribute to them. (...) On the basis of interviews with thirteen research mathematicians, we provide a broad range of relevant aspects of definitions. In particular, we address various roles of definitions and show that definitions are not just a product of mathematical factors, but also of social and contingent factors. Furthermore, we provide concrete examples of how mathematicians interact and think about definition. This broad empirical basis with a variety of examples provides an optimal starting point for future investigations into definitions in mathematical practice. (shrink)

Understanding is a valued trait in any epistemic practice, scientific or not. Yet, when it comes to characterizing its nature, the notion has not received the philosophical attention it deserves. We have set ourselves three tasks in this paper. First, we defend the importance of this endeavor. Second, we consider and criticize a number of proposals to this effect. Third, we defend an alternative account, focusing on abilities as the proper mark of understanding.

During the first half of the nineteenth century, mathematical analysis underwent a transition from a predominantly formula-centred practice to a more concept-centred one. Central to this development was the reorientation of analysis originating in Augustin-Louis Cauchy's (1789–1857) treatment of infinite series in his Cours d’analyse. In this work, Cauchy set out to rigorize analysis, thereby critically examining and reproving central analytical results. One of Cauchy's first and most ardent followers was the Norwegian Niels Henrik Abel (1802–1829) who vowed to shed (...) some light on the vast darkness in analysis.This paper investigates some important aspects of Abel's contribution to the reorientation in analysis. In particular, it stresses the role for critical revision in the process of rigorization. By critically examining past practice, the new practice sought to explain the relative success of the previous—now outdated—approach. This is illustrated by discussing a number of issues related to Abel's new proof of the binomial theorem (1826) including his reactions to the exception that he encountered to one of the central theorems of Cauchy's theory.Following this discussion, the formation of new concepts as the result of critical revisions is illustrated by analysing the early history of the concept of absolute convergence. Thereby, it is shown how a new concept was distilled, investigated, put to use and eventually superseded. (shrink)

We mathematical animals should be grateful that mathematics is instrumentally useful. We should not, however, forget its other contributions to human happiness. Bertrand Russell and John Dewey offer timely reminders that provide insight into the role of non-mathematicians in the evaluation of mathematics.

My dissertation focuses on mathematical explanation found in proofs looked at from a historical point of view, while stressing the importance of mathematical practices. Current philosophical theories on explanatory proofs emphasize the structure and content of proofs without any regard to external factors that influence a proof’s explanatory power. As a result, the major philosophical views have been shown to be inadequate in capturing general aspects of explanation. I argue that, in addition to form and content, a proof’s explanatory power (...) depends on its targeted audience. History is useful here, because from it, we are able to follow the transition from a first-generation proof, which is usually non-explanatory, into its explanatory version. By tracking the similarities and differences between these proofs, we are able to gain a better understanding of what makes a proof explanatory according to mathematicians who have the relevant background to evaluate it as so. My first chapter discusses why history is important for understanding mathematical practices. I describe two kinds of history: one that presents a narrative of events, which influenced developments in mathematics both directly and indirectly, and another, typically used in mathematical research, which concentrates only on technical developments. I contend that both versions of the past benefit the philosopher. History used in research gives us an idea of what mathematicians desire or find to be important, while history written by historians shows us what effects these have on mathematical practices. The next two chapters are about explanatory proofs. My second chapter examines the main theories of mathematical explanation. I argue that these theories are short-sighted as they only consider what appears in a proof without considering the proof’s purported audience or background knowledge necessary to understand the proof. In the third chapter, I propose an alternative way of analyzing explanatory proofs. Here, I suggest looking at a theorem’s history, which includes its successive proofs, as well as the mathematicians who wrote them. From this, we can better understand how and why mathematicians prove theorems in multiple ways, which depends on the purposes of these theorems. The last chapter is a case study on the computer proof of the Four Color Theorem by Appel and Haken. Here, I compare and contrast what philosophers and mathematicians have had to say about the proof. I argue that the main philosophical worry regarding the theorem—its unsurveyability—did not make a strong impact on the mathematical community and would have hindered mathematical development in computer-assisted proofs. By studying the history of the theorem, we learn that Appel and Haken relied on the strategy of Kempe’s flawed proof from the 1800s (which, obviously, did not involve a computer). Two later proofs, also aided by computer, were developed using similar methods. None of these proofs are explanatory, but not because of their massive lengths. Rather, the methods used in these proofs are a series of calculations that exhaust all possible configurations of maps. (shrink)