Van Fraassen and others have urged that judgements of explanations are relative to why-questions; explanations should be considered good in so far as they effectively answer why-questions. In this paper, I evaluate van Fraassen's theory with respect to mathematical explanation. I show that his theory cannot recognize any proofs as explanatory. I also present an example that contradicts the main thesis of the why-question approach—an explanation that appears explanatory despite its inability to answer the why-question that motivated it. This example (...) shows how explanatory judgements can be context-dependent without being why-question-relative. (shrink)

The literature on mathematical explanation contains numerous examples of explanatory, and not so explanatory proofs. In this paper we report results of an empirical study aimed at investigating mathematicians’ notion of explanatoriness, and its relationship to accounts of mathematical explanation. Using a Comparative Judgement approach, we asked 38 mathematicians to assess the explanatory value of several proofs of the same proposition. We found an extremely high level of agreement among mathematicians, and some inconsistencies between their assessments and claims in the (...) literature regarding the explanatoriness of certain types of proofs. (shrink)

Gauss’s quadratic reciprocity theorem is among the most important results in the history of number theory. It’s also among the most mysterious: since its discovery in the late 18th century, mathematicians have regarded reciprocity as a deeply surprising fact in need of explanation. Intriguingly, though, there’s little agreement on how the theorem is best explained. Two quite different kinds of proof are most often praised as explanatory: an elementary argument that gives the theorem an intuitive geometric interpretation, due to Gauss (...) and Eisenstein, and a sophisticated proof using algebraic number theory, due to Hilbert. Philosophers have yet to look carefully at such explanatory disagreements in mathematics. I do so here. According to the view I defend, there are two important explanatory virtues—depth and transparency—which different proofs (and other potential explanations) possess to different degrees. Although not mutually exclusive in principle, the packages of features associated with the two stand in some tension with one another, so that very deep explanations are rarely transparent, and vice versa. After developing the theory of depth and transparency and applying it to the case of quadratic reciprocity, I draw some morals about the nature of mathematical explanation. (shrink)

This is a teaching and learning guide to accompany "Explanation in Mathematics: Proofs and Practice".

Mathematicians distinguish between proofs that explain their results and those that merely prove. This paper explores the nature of explanatory proofs, their role in mathematical practice, and some of the reasons why philosophers should care about them. Among the questions addressed are the following: what kinds of proofs are generally explanatory (or not)? What makes a proof explanatory? Do all mathematical explanations involve proof in an essential way? Are there really such things as explanatory proofs, and if so, how do (...) they relate to the sorts of explanation encountered in philosophy of science and metaphysics? (shrink)

We investigated whether mathematicians typically agree about the qualities of mathematical proofs. Between-mathematician consensus in proof appraisals is an implicit assumption of many arguments made by philosophers of mathematics, but to our knowledge the issue has not previously been empirically investigated. We asked a group of mathematicians to assess a specific proof on four dimensions, using the framework identified by Inglis and Aberdein (2015). We found widespread disagreement between our participants about the aesthetics, intricacy, precision and utility of the proof, (...) suggesting that a priori assumptions about the consistency of mathematical proof appraisals are unreasonable. (shrink)

According to a widespread view in metaphysics and philosophy of science, all explanations involve relations of ontic dependence between the items appearing in the explanandum and the items appearing in the explanans. I argue that a family of mathematical cases, which I call “viewing-as explanations”, are incompatible with the Dependence Thesis. These cases, I claim, feature genuine explanations that aren’t supported by ontic dependence relations. Hence the thesis isn’t true in general. The first part of the paper defends this claim (...) and discusses its significance. The second part of the paper considers whether viewing-as explanations occur in the empirical sciences, focusing on the case of so-called fictional models. It’s sometimes suggested that fictional models can be explanatory even though they fail to represent actual worldly dependence relations. Whether or not such models explain, I suggest, depends on whether we think scientific explanations necessarily give information relevant to intervention and control. Finally, I argue that counterfactual approaches to explanation also have trouble accommodating viewing-as cases. (shrink)

In a growing number of papers, one encounters arguments to the effect that certain philosophical views are objectionable because they would imply that there are necessary truths for whose necessity there is no explanation. That is, they imply that there are propositions p such that (a) it is necessary that p, but (b) there is no explanation why it is necessary that p. For short, they imply that there are “brute necessities.” Therefore, the arguments conclude, the views in question should (...) be rejected in favor of rival views under which the necessities would be explained. This style of argument raises a number of important and difficult questions. Do necessary truths really require explanation? Are they not paradigms of truths that either need no explanation or automatically have one, being in some sense self‐explanatory? If some necessary truths do require or admit of explanation, what types of explanation, are available? Are some necessary truths explained by other necessary truths? Are some necessary truths self‐explanatory? Are all necessary truths either self‐explanatory or explained by others? Or are there some necessary truths that are truly brute? This article surveys several representative arguments from brute necessity as well as a variety of answers to the questions above, noting their bearing on arguments from bruteness. (shrink)

The aim of this paper is to explore the ways in which Axiomatic Reconstructions of Quantum Theory in terms of Information-Theoretic principles can contribute to explaining and understanding quantum phenomena, as well as to study their explanatory limitations. This is achieved in part by offering an account of the kind of explanation that axiomatic reconstructions of Quantum Theory provide, and re-evaluating the epistemic status of the program in light of this explanation. As illustrative case studies, I take Clifton's, Bub's and (...) Halvorson's characterization theorem and Popescu's and Rohrlich's toy models, and their explanatory contribution with respect to quantum nonlocality. On the one hand, I argue that ARQITs can aspire to provide genuine explanations of quantum nonlocality. On the other hand, I argue that such explanations cannot rule out a mechanical quantum theory. (shrink)

Aesthetics in philosophy of mathematics is too narrowly construed. Beauty is not the only feature in mathematics that is arguably aesthetic. While not the highest aesthetic value, being interesting is a sine qua non for publishability. Of the many ways to be interesting, being explanatory has recently been discussed. The motivational power of what is interesting is important for both directing research and stimulating education. The scientific satisfaction of curiosity and the artistic desire for beautiful results are complementary but both (...) aesthetic. (shrink)

In this paper we discuss three interrelated questions. First: is explanation in mathematics a topic that philosophers of mathematics can legitimately investigate? Second: are the specific aims that philosophers of mathematical explanation set themselves legitimate? Finally: are the models of explanation developed by philosophers of science useful tools for philosophers of mathematical explanation? We argue that the answer to all these questions is positive. Our views are completely opposite to the views that Mark Zelcer has put forward recently. Throughout this (...) paper, we show why Zelcer’s arguments fail. (shrink)

Dans son « Découverte d'un nouveau principe de mécanique » (1750) Euler a donné, pour la première fois, une preuve du théorème qu'on appelle aujourd'hui le Théorème d'Euler. Dans cet article je vais me concentrer sur la preuve originale d'Euler, et je vais montrer comment la pratique mathématique d Euler peut éclairer le débat philosophique sur la notion de preuves explicatives en mathématiques. En particulier, je montrerai comment l'un des modèles d'explication mathématique les plus connus, celui proposé par Mark Steiner (...) dans son article « Mathematical explanation » (1978), n'est pas en mesure de rendre compte du caractère explicatif de la preuve donnée par Euler. Cela contredit l'intuition originale du mathématicien Euler, qui attribuait à sa preuve un caractère explicatif spécifique. (shrink)

One of the popular explications of the deflationary tenet of ‘thinness’ of truth is the conservativeness demand: the declaration that a deflationary truth theory should be conservative over its base. This paper contains a critical discussion and assessment of this demand. We ask and answer the question of whether conservativity forms a part of deflationary doctrines.

Unlike explanation in science, explanation in mathematics has received relatively scant attention from philosophers. Whereas there are canonical examples of scientific explanations, there are few examples that have become widely accepted as exhibiting the distinction between mathematical proofs that explain why some mathematical theorem holds and proofs that merely prove that the theorem holds without revealing the reason why it holds. This essay offers some examples of proofs that mathematicians have considered explanatory, and it argues that these examples suggest a (...) particular account of explanation in mathematics. The essay compares its account to Steiner's and Kitcher's. Among the topics that arise are proofs that exploit symmetries, mathematical coincidences, brute-force proofs, simplicity in mathematics, merely clever proofs, and proofs that unify what other proofs treat as separate cases. (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 mind-brain identity theory, the thesis that sensations are identical with properties or processes of the brain, was introduced into contemporary discussion by U.T. Place, Herbert Feigl, and J.J.C Smart in the 1950s. Despite its widespread rejection in the following decades, the identity theory has received several carefully articulated defenses in recent years. Aside from developing novel responses to well-known arguments against the identity theory, contemporary identity theorists have argued that the epistemological resources available to support the adoption of identities (...) are more plentiful than has often been supposed; further, they have argued that mind-brain identities allow for the resolution of otherwise intractable explanatory puzzles about the phenomenal properties of experience. From an epistemological perspective, identity theorists have thus argued that a central reason for believing theoretical identities—both mind-brain identities as well as more mundane identities such as water = H2O—stems from the explanatory power that they confer. Yet from an explanatory perspective, identity theorists have maintained that identities cannot themselves be explained; indeed, they have maintained that it is hardly intelligible to request an explanation for an identity. This paper considers these ideas draws out an important tension between them. The central claim is that insofar as identity theorists insist on the explanatorily efficacy of identities, they should concede that there is a good sense in which theoretical identities can be explained. However, it is moreover argued that this concession is not especially problematic and, indeed, ought to be welcomed by identity theorists. (shrink)

The issue of proper functioning of operative computing and the utility of program verification, both in general and of specific methods, has been discussed a lot. In many of those discussions, attempts have been made to take mathematics as a model of knowledge and certitude achieving, and accordingly infer about the suitable ways to handle computing. I shortly review three approaches to the subject, and then take a stance by considering social factors which affect the epistemic status of both mathematics (...) and computing. I use the analogy between mathematics and computing in reverse—that is to say, I consider operative computing as a form of making mathematics, and so attempt to learn from computing to mathematics in general. I conclude that mathematics engineering is a field to be both developed for practical improvement of doing mathematics and taken into consideration while philosophizing about mathematics as well. (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.

Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic logic in particular, buttressed (...) by assertion-conditional semantics, is often considered to enjoy a degree of meaning-theoretical respectability unattainable by classical logic.The decision to forgo the classical inference rules is not always made lightly. Thus, Dummett: " In the resolution of the conflict between [the view that generally accepted classical modes of inference ought to be theoretically accommodated, and the demand that any such accommodation be achieved without recourse to bivalence] lies, as I see it, one of the most fundamental and intractable problems in the theory of meaning; indeed, in all philosophy. "The present article ventures to suggest that the conflict need not be irresoluble. Helping ourselves only to such conceptual resources as are standardly invoked by proponents of intuitionistic logic, we shall formulate a rudimentary meaning theory for a selection of logical constants, define a relation of valid inferability, and prove that the latter includes all of classical first-order logic. The result is essentially that reported in Sandqvist as Theorem 2.20.2. TheoryWe will be considering a standard-syntax first-order language with ⊃, ⊥ and ∀ as its only primitive logical constants. We assume countable supplies of individual constants, individual functors , and predicates , as well as a denumerably infinite set of individual variables. By a basic 1 formula we will mean one that …[Full Text of this Article]. (shrink)

Suppose you attend a seminar where a mathematician presents a proof to some of his colleagues. Suppose further that what he is proving is an important mathematical statement Now the following happens: as the mathematician proceeds, his audience is amazed at first, then becomes angry and finally ends up disturbing the lecture (some walk out, some laugh, …). If in addition, you see that the proof he is presenting is formally speaking (nearly) correct, would you say you are witnessing an (...) extraordinary event in urgent need of explanation? Surely, your answer would be yes. But do events of this type actually occur? The matter of the fact is, yes, they do. This paper presents the details of such an event, suggests a possible explanation and examines its implications for our understanding of mathematical practice. (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)

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)

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)

Craig casts doubt upon the project of trying to give the traditional sort of necessary and sufficient conditions for A knows that p. He interprets the inadequacy of existing analyses of knowledge as evidence that our concept of knowledge is complex and diffuse, and concludes that we should aim to understand it by thinking about the rôle the concept plays in our lives, rather than by trying to find necessary and sufficient conditions for the truth of knowledge ascriptions.There is surely (...) something right about Craig's view: we are unlikely to succeed in any attempt to analyse away the intricacies in our concept of knowledge. We cannot realistically hope to uncover a set of necessary and sufficient conditions for A knows that p which are in all cases either clearly satisfied or clearly not satisfied. Nor, I suspect, is it possible to offer necessary and sufficient conditions for knowledge which are widely accepted as being more securely understood than knowledge itself. (shrink)

Are there arguments in mathematics? Are there explanations in mathematics? Are there any connections between argument, proof and explanation? Highly controversial answers and arguments are reviewed. The main point is that in the case of a mathematical proof, the pragmatic criterion used to make a distinction between argument and explanation is likely to be insufficient for you may grant the conclusion of a proof but keep on thinking that the proof is not explanatory.

Mathematical explanations are poorly understood. Although mathematicians seem to regularly suggest that some proofs are explanatory whereas others are not, none of the philosophical accounts of what such claims mean has become widely accepted. In this paper we explore Wilkenfeld’s suggestion that explanations are those sorts of things that generate understanding. By considering a basic model of human cognitive architecture, we suggest that existing accounts of mathematical explanation are all derivable consequences of Wilkenfeld’s ‘functional explanation’ proposal. We therefore argue that (...) the explanatory criteria offered by earlier accounts can all be thought of as features that make it more likely that a mathematical proof will generate understanding. On the functional account, features such as characterising properties, unification, and salience correlate with explanatoriness, but they do not define explanatoriness. (shrink)

In recent years, philosophical work directly concerned with the practice of mathematics has intensified, giving rise to a movement known as the philosophy of mathematical practice . In this paper we offer a survey of this movement aimed at mathematics educators. We first describe the core questions philosophers of mathematical practice investigate as well as the philosophical methods they use to tackle them. We then provide a selective overview of work in the philosophy of mathematical practice covering topics including the (...) distinction between formal and informal proofs, visualization and artefacts, mathematical explanation and understanding, value judgments, and mathematical design. We conclude with some remarks on the potential connections between the philosophy of mathematical practice and mathematics education. (shrink)

Explanation in mathematics has recently attracted increased attention from philosophers. The central issue is taken to be how to distinguish between two types of mathematical proofs: those that explain why what they prove is true and those that merely prove theorems without explaining why they are true. This way of framing the issue neglects the possibility of mathematical explanations that are not proofs at all. This paper addresses what it would take for a non-proof to explain. The paper focuses on (...) a particular example of an explanatory non-proof: an argument that mathematicians regard as explaining why a given theorem holds regarding the derivative of an infinite sum of differentiable functions. The paper contrasts this explanatory non-proof with various non-explanatory proofs of the same theorem. The paper offers an account of what makes the given non-proof explanatory. This account is motivated by investigating the difficulties that arise when we try to extend Mark Steiner’s influential account of explanatory proofs to cover this explanatory non-proof. (shrink)

Much recent work on mathematical explanation has presupposed that the phenomenon involves explanatory proofs in an essential way. I argue that this view, ‘proof chauvinism’, is false. I then look in some detail at the explanation of the solvability of polynomial equations provided by Galois theory, which has often been thought to revolve around an explanatory proof. The article concludes with some general worries about the effects of chauvinism on the theory of mathematical explanation. 1Introduction 2Why I Am Not a (...) Proof Chauvinist 2.1Proof chauvinism and mathematical practice 2.2Proof chauvinism and philosophy 3An Example: Galois Theory and Explanatory Proof 4Conclusion. (shrink)

Philosophers of mathematics commonly distinguish between explanatory and non-explanatory proofs. An important subclass of mathematical proofs are proofs by induction. Are they explanatory? This paper addresses the question, based on general principles about explanation. First, a recent argument for a negative answer is discussed and rebutted. Second, a case is made for a qualified positive take on the issue.

We describe techniques for constructing models of size continuum inωsteps by simultaneously building a perfect set of enmeshed countable Henkin sets. Such models have perfect, asymptotically similar subsets. We survey applications involving Borel models, atomic models, two-cardinal transfers and models respecting various closure relations.

Philosophers who regard some mathematical proofs as explaining why theorems hold, and others as merely proving that they do hold, disagree sharply about the explanatory value of proofs by mathematical induction. I offer an argument that aims to resolve this conflict of intuitions without making any controversial presuppositions about what mathematical explanations would be.