Some mathematical proofs explain why the theorems they prove hold. This paper identifies several challenges for any counterfactual account of explanation in mathematics (that is, any account according to which an explanatory proof reveals how the explanandum would have been different, had facts in the explanans been different). The paper presumes that countermathematicals can be nontrivial. It argues that nevertheless, a counterfactual account portrays explanatory power as too easy to achieve, does not capture explanatory asymmetry, and fails to specify why (...) certain proofs are explanatory and others are not. Greater informativeness about counterfactual dependence can even yield less explanatory power. (shrink)

This paper sets out to adduce visual evidence for Kroneckerian finitism by making perspicuous some of the insights that buttress Kronecker’s conception of arithmetization as a process aiming at disclosing the arithmetical essence enshrined in analytical formulas, by spotting discrete patterns through algorithmic fine-tuning. In the light of a fairly tractable case study, it is argued that Kronecker’s main tenet in philosophy of mathematics is not so much an ontological as a methodological one, inasmuch as highly demanding requirements regarding mathematical (...) understanding prevail over mere preemptive reductionism to whole numbers. (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.

We reconstruct essential features of Lagrange’s theory of analytical functions by exhibiting its structure and basic assumptions, as well as its main shortcomings. We explain Lagrange’s notions of function and algebraic quantity, and we concentrate on power-series expansions, on the algorithm for derivative functions, and the remainder theorem—especially on the role this theorem has in solving geometric and mechanical problems. We thus aim to provide a better understanding of Enlightenment mathematics and to show that the foundations of mathematics did not, (...) for Lagrange, concern the solidity of its ultimate bases, but rather purity of method—the generality and internal organization of the discipline. (shrink)

In this paper I shall adopt a possible reading of the notions of ‘explanatory indispensability’ and ‘genuine mathematical explanation in science’ on which the Enhanced Indispensability Argument proposed by Alan Baker is based. Furthermore, I shall propose two examples of mathematical explanation in science and I shall show that, whether the EIA-partisans accept the reading I suggest, they are easily caught in a dilemma. To escape this dilemma they need to adopt some account of explanation and offer a plausible answer (...) to the following ‘question of evidence’: What is a genuine mathematical explanation in empirical science and on what basis do we consider it as such? Finally, I shall suggest how a possible answer to the question of evidence might be given through a specific account of mathematical explanation in science. Nevertheless, the price of adopting this standpoint is that the genuineness of mathematical explanations of scientific facts turns out to be dependent on pragmatic constraints and therefore cannot be plugged in EIA and used to establish existential claims about mathematical objects. (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)

The paper outlines an interpretation of one of the most important and original contributions of David Hilbert’s monograph Foundations of Geometry , namely his internal arithmetization of geometry. It is claimed that Hilbert’s profound interest in the problem of the introduction of numbers into geometry responded to certain epistemological aims and methodological concerns that were fundamental to his early axiomatic investigations into the foundations of elementary geometry. In particular, it is shown that a central concern that motivated Hilbert’s axiomatic investigations (...) from very early on was the aim of providing an independent basis for geometry. Accordingly, these concerns about an independent grounding for elementary geometry determined very clear methodological constraints in the process of embedding it into a formal axiomatic system. It is argued that Hilbert not only sought to show that geometry could be considered a pure mathematical theory, once it was presented as a formal axiomatic system; he also aimed at showing that in the construction of such an axiomatic system one could proceed purely geometrically, avoiding concept formations borrowed from other mathematical disciplines like arithmetic or analysis. (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)

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)

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)