This book discusses the problem of mathematical knowledge, and its broader philosophical ramifications. It argues that the problem of explaining the (defeasible) justification of our mathematical beliefs (‘the justificatory challenge’), arises insofar as disagreement over axioms bottoms out in disagreement over intuitions. And it argues that the problem of explaining their reliability (‘the reliability challenge’), arises to the extent that we could have easily had different beliefs. The book shows that mathematical facts are not, in general, empirically accessible, contra Quine, (...) and that they cannot be dispensed with, contra Field. However, it argues that they might be so plentiful that our knowledge of them is intelligible. The book concludes with a complementary ‘pluralism’ about modality, logic and normative theory, highlighting its revisionary implications. Metaphysically, pluralism engenders a kind of perspectivalism and indeterminacy. Methodologically, it vindicates Carnap’s pragmatism, transposed to the key of realism. (shrink)

The distinction between propositional and doxastic justification is well-known among epistemologists. Propositional justification is often conceived as fundamental and characterized in an entirely apsychological way. In this chapter, I focus on beliefs based on deductive arguments. I argue that such an apsychological notion of propositional justification can hardly be reconciled with the idea that justification is a central component of knowledge. In order to propose an alternative notion, I start with the analysis of doxastic justification. I then offer a notion (...) of propositional justification, intersubjective propositional justification, that is neither entirely apsychological nor idiosyncratic. To do so, I argue that to be able to attribute propositional justification to a subject, we have to consider her social context as well as broad features of our human cognitive architecture. (shrink)

Open texture is a kind of semantic indeterminacy first systematically studied by Waismann. In this paper, extant definitions of open texture will be compared and contrasted, with a view towards the consequences of open-textured concepts in mathematics. It has been suggested that these would threaten the traditional virtues of proof, primarily the certainty bestowed by proof-possession, and this suggestion will be critically investigated using recent work on informal proof. It will be argued that informal proofs have virtues that mitigate the (...) danger posed by open texture. Moreover, it will be argued that while rigor in the guise of formalisation and axiomatisation might banish open texture from mathematical theories through implicit definition, it can do so only at the cost of restricting the tamed concepts in certain ways. (shrink)

In this paper, I discuss Whiting’s (2021) account of rational belief and discuss some unresolved issues arising from its reliance on epistemic possibility and, by extension, perspective-relative aprioricity.

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)

If there is an area of discourse in which disagreement is virtually absent, it is mathematics. After all, mathematicians justify their claims with deductive proofs: arguments that entail their conclusions. But is mathematics really exceptional in this respect? Looking at the history and practice of mathematics, we soon realize that it is not. First, deductive arguments must start somewhere. How should we choose the starting points (i.e., the axioms)? Second, mathematicians, like the rest of us, are fallible. Their ability to (...) recognize whether a putative proof is correct is not infallible. In most cases, disagreement over the correctness of a putative proof is, however, evanescent. Once an error is spotted and communicated, the disagreement disappears. But this is not always the case. Sometimes it is recalcitrant; that is, it persists over time. In order to zoom in on this type of disagreement and explain its very possibility, we focus on a single case study: a decades-long (1921-1949) controversy between Federigo Enriques and Francesco Severi, two prominent exponents of the Italian school of algebraic geometry. We suggest that the instability of the mathematical community to which they belonged can be explained by the gap between an abstract criterion of rigor and local criteria of acceptability. It is this instability that made the existence of recalcitrant disagreement over putative proofs possible. We do not condemn speculative mathematics but rather its pretense of being rigorous mathematics. In this respect, we show that the overly self-confident Severi and the more intuitive, visionary Enriques had a completely different attitude. (shrink)

The classification of algebraic surfaces by the Italian School of algebraic geometry is universally recognized as a breakthrough in 20th-century mathematics. The methods by which it was achieved do not, however, meet the modern standard of rigor and therefore appear dubious from a contemporary viewpoint. In this article, we offer a glimpse into the mathematical practice of the three leading exponents of the Italian School of algebraic geometry: Castelnuovo, Enriques, and Severi. We then bring into focus their distinctive conception of (...) rigor and intuition. Unlike what is often assumed today, from their perspective, rigor is neither opposed to intuition nor understood as a unitary phenomenon – Enriques distinguishes between small-scale rigor and large-scale rigor and Severi between formal rigor and substantial rigor. Finally, we turn to the notion of mathematical objectivity. We draw from our case study in order to advance a multi-dimensional analysis of objectivity. Specifically, we suggest that various types of rigor may be associated with different conceptions of objectivity: namely, objectivity as faithfulness to facts and objectivity as intersubjectivity. (shrink)

Paying attention to the inner workings of mathematicians has led to a proliferation of new themes in the philosophy of mathematics. Several of these have to do with epistemology. Philosophers of mathematical practice, however, have not (yet) systematically engaged with general (analytic) epistemology. To be sure, there are some exceptions, but they are few and far between. In this chapter, I offer an explanation of why this might be the case and show how the situation could be remedied. I contend (...) that it is only by conceiving the knowing subject(s) as embodied, fallible, and embedded in a specific context (along the lines of what has been done within social and feminist epistemology) that we can pursue an epistemology of mathematics sensitive to actual mathematical practice. I further suggest that this reconception of the knowing subject(s) does not force us to abandon the traditional framework of epistemology in which knowledge requires justified true belief. It does, however, lead to a fallible conception of mathematical justification that, among other things, makes Gettier cases possible. This shows that topics considered to be far removed from the interests of philosophers of mathematical practice might reveal to be relevant to them. (shrink)

A proof P of a theorem T is transferable when a typical expert can become convinced of T solely on the basis of their prior knowledge and the information contained in P. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proof P is fixable when it’s possible for other experts to correct any mistakes P contains without having to develop significant new mathematics. Habgood-Coote and Tanswell have observed that some acceptable proofs are both fixable and (...) in need of fixing, in the sense that they contain nontrivial mistakes. The claim that acceptable proofs must be transferable seems quite plausible. The claim that some acceptable proofs need fixing seems plausible too. Unfortunately, these attractive suggestions stand in tension with one another. I argue that the transferability requirement is the problem. Acceptable proofs need only satisfy a weaker requirement I call “corrigibility”. I explain why, despite appearances, the corrigibility standard is preferable to stricter alternatives. (shrink)

Let mathematical justification be the kind of justification obtained when a mathematician provides a proof of a theorem. Are Gettier cases possible for this kind of justification? At first sight we might think not: The standard for mathematical justification is proof and, since proof is bound at the hip with truth, there is no possibility of having an epistemically lucky justification of a true mathematical proposition. In this paper, I argue that Gettier cases are possible (and indeed actual) in mathematical (...) reasoning. By analysing these cases, I suggest that the Gettier phenomenon indicates some upshots for actual mathematical practice. (shrink)

Analogy has received attention as a form of inductive reasoning in the empirical sciences. Its role in mathematics has, instead, received less consideration. This paper provides a novel account of how an analogy with a more familiar mathematical domain can contribute to the confirmation of a mathematical conjecture. By reference to case-studies, we propose a distinction between an _incremental_ and a _non-incremental_ form of confirmation by mathematical analogy. We offer an account of the former within the popular framework of Bayesian (...) confirmation theory. As for the non-incremental notion, we defend its role in rationally informing the prior credences of mathematicians in those circumstances in which no new mathematical evidence is introduced. The resulting framework captures many important aspects of the use of analogical inference in the domain of pure mathematics. (shrink)

In 1977, the first computer-assisted proof of a mathematical theorem was presented by K. Appel and W. Haken. The proof was met with a lot of criticism from both mathematicians and philosophers. In this paper, I present some examples of computer-assisted proofs, including Appel and Haken’s work. Then, I analyze the most famous arguments against the equal acceptance of computer-based and human-based proofs in mathematics and examine the philosophical assumptions behind the presented criticism. In the conclusion, I talk about whether (...) the philosophical assumptions are justified as they are, or one needs to take a specific philosophical position to accept them. (shrink)

From the perspective of mathematical practice, I examine positions claiming that mathematical objects are introduced by human agents. I consider in particular mathematical fictionalism and a recent position on social ontology formulated by Cole (2013, 2015). These positions are able to solve some of the challenges that non-realist positions face. I argue, however, that mathematical entities have features other than fictional characters and social institutions. I emphasise that the way mathematical objects are introduced is different and point to the multifaceted (...) role that relations and interconnections play in this context. Finally, I argue that mathematical entities can be considered to be pragmatically real. (shrink)