Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning results (...) in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (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.

It is widely accepted that in fallible reasoning potential error necessarily increases with every additional step, whether inferences or premises, because it grows in the same way that the probability of a lengthening conjunction shrinks. As it stands, this is disappointing but, I will argue, not out of keeping with our experience. However, consulting an expert, proof-checking, constructing gap-free proofs, and gathering more evidence for a given conclusion also add more steps, and we think these actions have the potential to (...) improve our reliability or justifiedness. Thus, the received wisdom about the growth of error implies a skepticism about the possibility of improving our reliability and level of justification through effort. Paradoxically, and even more implausibly, taking steps to decrease your potential error necessarily increases it. I will argue that the self-help steps listed here are of a distinctive type, involving composition rather than conjunction. Error grows differently over composition than over conjunction, I argue, and this dissolves the apparent paradox. (shrink)

With respect to the confirmation of mathematical propositions, proof possesses an epistemological authority unmatched by other means of confirmation. This paper is an investigation into why this is the case. I make use of an analysis drawn from an early reliability perspective on knowledge to help make sense of mathematical proofs singular epistemological status.

In recent decades, experimental mathematics has emerged as a new branch of mathematics. This new branch is defined less by its subject matter, and more by its use of computer assisted reasoning. Experimental mathematics uses a variety of computer assisted approaches to verify or prove mathematical hypotheses. For example, there is “number crunching” such as searching for very large Mersenne primes, and showing that the Goldbach conjecture holds for all even numbers less than 2 × 1018. There are “verifications” of (...) hypotheses which, while not definitive proofs, provide strong support for those hypotheses, and there are proofs involving an enormous amount of computer hours, which cannot be surveyed by any one mathematician in a lifetime. There have been several attempts to argue that one or another aspect of experimental mathematics shows that mathematics now accepts empirical or inductive methods, and hence shows mathematical apriorism to be false. Assessing this argument is complicated by the fact that there is no agreed definition of what precisely experimental mathematics is. However, I argue that on any plausible account of ’experiment’ these arguments do not succeed. (shrink)

Electronic computers form an integral part of modern mathematical practice. Several high-profile results have been proven with techniques where computer calculations form an essential part of the proof. In the traditional philosophical literature, such proofs have been taken to constitute a posteriori knowledge. However, this traditional stance has recently been challenged by Mark McEvoy, who claims that computer calculations can constitute a priori mathematical proofs, even in cases where the calculations made by the computer are too numerous to be surveyed (...) by human agents. In this article we point out the deficits of the traditional literature that has called for McEvoy’s correction. We also explain why McEvoy’s defence of mathematical apriorism fails and we discuss how the debate over the epistemological status of computer-assisted mathematics contains several unfortunate conceptual reductions. (shrink)

In spite of their practical importance, the connections between technology and mathematics have not received much scholarly attention. This article begins by outlining how the technology–mathematics relationship has developed, from the use of simple aide-mémoires for counting and arithmetic, via the use of mathematics in weaving, building and other trades, and the introduction of calculus to solve technological problems, to the modern use of computers to solve both technological and mathematical problems. Three important philosophical issues emerge from this historical résumé: (...) how mathematical knowledge depends on technology, the definition of the hybrid concept of a computation, and the usefulness of mathematics in technology. Each of these issues is briefly discussed, and it is shown that in order to analyze them, we need to combine tools and ideas from both the philosophy of technology and the philosophy of mathematics. In conclusion, it is argued that much more of interest can be found in the historically and philosophically unexplored terrains of the technology–mathematics relationship. (shrink)

In this paper, I assume, perhaps controversially, that translation into a language of formal logic is not the method by which mathematicians assess mathematical reasoning. Instead, I argue that the actual practice of analyzing, evaluating and critiquing mathematical reasoning resembles, and perhaps equates with, the practice of informal logic or argumentation theory. It doesn’t matter whether the reasoning is a full-fledged mathematical proof or merely some non-deductive mathematical justification: in either case, the methodology of assessment overlaps to a large extent (...) with argument assessment in non-mathematical contexts. I demonstrate this claim by considering the assessment of axiomatic or deductive proofs, probabilistic evidence, computer-aided proofs, and the acceptance of axioms. I also consider Jody Azzouni’s ‘derivation indicator’ view of proofs because it places derivations—which may be thought to invoke formal logic—at the center of mathematical justificatory practice. However, when the notion of ‘derivation’ at work in Azzouni’s view is clarified, it is seen to accord with, rather than to count against, the informal logical view I support. Finally, I pose several open questions for the development of a theory of mathematical argument. (shrink)

The fallibility of deduction is the thesis that a thoughtful speaker-reasoner can wrongly believe that an inference is deductively valid. The author presents an argument to the effect that the fallibility of deduction is incompatible with the widespread view that deduction is epistemically unfruitful (the conclusion is contained in the premises, and the transition from premises to conclusion never extends knowledge). If the fallibility of deduction is a fact, the argument presented is a refutation of the doctrine of the unfruitfulness (...) of deduction. But its relevance goes further, because the argument reveals a connection between two different problems: a solution to the problem of fruitfulness (how can deductive inferences increase our knowledge?) is a starting point for a solution to the problem of fallibility (how can deductive inferences be wrong?). To solve the problem of fruitfulness, Michael Dummett proposed some general ideas concerning meaning and inference. Starting from these meaning-theoretical ideas, one can develop an explanation of the fallibility of deduction. The general explanatory strategy does not depend on the choice between a theory of meaning centered on truth, verification, inferential role, or on other key notions. (shrink)

The ArgumentThe belief in the existence of eternal mathematical truth has been part of this science throughout history. Bourbaki, however, introduced an interesting, and rather innovative twist to it, beginning in the mid-1930s. This group of mathematicians advanced the view that mathematics is a science dealing with structures, and that it attains its results through a systematic application of the modern axiomatic method. Like many other mathematicians, past and contemporary, Bourbaki understood the historical development of mathematics as a series of (...) necessary stages inexorably leading to its current state — meaning by this, the specific perspective that Bourbaki had adopted and were promoting. But unlike anyone else, Bourbaki actively put forward the view that their conception of mathematics was not only illuminating and useful for dealing with the current concerns of mathematics, but that this was in fact the ultimate stage in the evolution of mathematics, bound to remain unchanged by any future development of this science. In this way, they were extending in an unprecedented way the domain of validity of the belief in the eternal character of mathematical truths, from the body to the images of mathematical knowledge.Bourbaki were fond of presenting their insistence on the centrality of the modern axiomatic method as a way to ensure the eternal character of mathematical truth as an offshoot of Hilbert's mathematical heritage. A detailed examination of Hilbert's actual conception of the axiomatic method, however, brings to the fore interesting differences between it and Bourbaki's conception, thus underscoring the historically conditioned character of certain, fundamental mathematical beliefs. (shrink)

The ArgumentRecent studies in the philosophy of mathematics have increasingly stressed the social and historical dimensions of mathematical practice. Although this new emphasis has fathered interesting new perspectives, it has also blurred the distinction between mathematics and other scientific fields. This distinction can be clarified by examining the special interaction of thebodyandimagesof mathematics.Mathematics has an objective, ever-expanding hard core, the growth of which is conditioned by socially and historically determined images of mathematics. Mathematics also has reflexive capacities unlike those of (...) any other exact science. In no other exact science can the standard methodological framework usedwithinthe discipline also be used to study the nature of the discipline itself.Although it has always been present in mathematical research, reflexive thinking has become increasingly central to mathematics over the past century. Many of the images of the discipline have been dictated by the increase in reflexive thinking which has also determined a great portion of the contemporary philosophy and historiography of mathematics. (shrink)

The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers cannot be a priori. It also created a lingering impression to the effect that such proofs depend heavily for their soundness on large amounts of computation-intensive custom-built software. Contra Tymoczko, we argue that the justification provided by certain computerized mathematical proofs is not fundamentally different from that provided by surveyable (...) proofs, and can be sensibly regarded as a priori. We also show that the aforementioned impression is mistaken because it fails to distinguish between proof search (the context of discovery) and proof checking (the context of justification). By using mechanized proof assistants capable of producing certificates that can be independently checked, it is possible to carry out complex proofs without the need to trust arbitrary custom-written code. We only need to trust one fixed, small, and simple piece of software: the proof checker. This is not only possible in principle, but is in fact becoming a viable methodology for performing complicated mathematical reasoning. This is evinced by a new proof of the four-color theorem that appeared in 2005, and which was developed and checked in its entirety by a mechanical proof system. (shrink)

Written by experts in the field, this volume presents a comprehensive investigation into the relationship between argumentation theory and the philosophy of mathematical practice. Argumentation theory studies reasoning and argument, and especially those aspects not addressed, or not addressed well, by formal deduction. The philosophy of mathematical practice diverges from mainstream philosophy of mathematics in the emphasis it places on what the majority of working mathematicians actually do, rather than on mathematical foundations. -/- The book begins by first challenging the (...) assumption that there is no role for informal logic in mathematics. Next, it details the usefulness of argumentation theory in the understanding of mathematical practice, offering an impressively diverse set of examples, covering the history of mathematics, mathematics education and, perhaps surprisingly, formal proof verification. From there, the book demonstrates that mathematics also offers a valuable testbed for argumentation theory. Coverage concludes by defending attention to mathematical argumentation as the basis for new perspectives on the philosophy of mathematics. ​. (shrink)

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)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

The Four-Colour Theorem (4CT) proof, presented to the mathematical community in a pair of papers by Appel and Haken in the late 1970's, provoked a series of philosophical debates. Many conceptual points of these disputes still require some elucidation. After a brief presentation of the main ideas of Appel and Haken’s procedure for the proof and a reconstruction of Thomas Tymoczko’s argument for the novelty of 4CT’s proof, we shall formulate some questions regarding the connections between the points raised by (...) Tymoczko and some Wittgensteinian topics in the philosophy of mathematics such as the importance of the surveyability as a criterion for distinguishing mathematical proofs from empirical experiments. Our aim is to show that the “characteristic Wittgensteinian invention” (Mühlhölzer 2006) – the strong distinction between proofs and experiments – can shed some light in the conceptual confusions surrounding the Four-Colour Theorem. (shrink)