Nondeductive Methods in Mathematics

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as the Riemann hypothesis, have had to be considered in terms of the evidence for and against them. In recent decades, massive increases in computer power have permitted the gathering of huge amounts of numerical evidence, both for conjectures in pure mathematics and (...) for the behavior of complex applied mathematical models and statistical algorithms. Mathematics has therefore become (among other things) an experimental science (though that has not diminished the importance of proof in the traditional style). We examine how the evaluation of evidence for conjectures works in mathematical practice. We explain the (objective) Bayesian view of probability, which gives a theoretical framework for unifying evidence evaluation in science and law as well as in mathematics. Numerical evidence in mathematics is related to the problem of induction; the occurrence of straightforward inductive reasoning in the purely logical material of pure mathematics casts light on the nature of induction as well as of mathematical reasoning. (shrink)

The motivating question of this paper is: ‘How are our beliefs in the theorems of mathematics justified?’ This is distinguished from the question ‘How are our mathematical beliefs reliably true?’ We examine an influential answer, outlined by Russell, championed by Gödel, and developed by those searching for new axioms to settle undecidables, that our mathematical beliefs are justified by ‘intuitions’, as our scientific beliefs are justified by observations. On this view, axioms are analogous to laws of nature. They are postulated (...) to best systematize the data to be explained. We argue that there is a decisive difference between the cases. There is agreement on the data to be systematized in the scientific case that has no analog in the mathematical one. There is virtual consensus over observations, but conspicuous dispute over intuitions. In this respect, mathematics more closely resembles stereotypical philosophy. We conclude by distinguishing two ideas that have long been associated -- realism (the idea that there is an independent reality) and objectivity (the idea that in a disagreement, only one of us can be right). We argue that, while realism is true of mathematics and philosophy, these domains fail to be objective. One upshot of the discussion is that even questions of fundamental physics may fail to be objective in roughly the sense that the question, ‘Is the Parallel Postulate is true?’, understood as one of pure mathematics, fails to be. Another is a kind of pragmatism. Factual questions in mathematics, modality, logic, and evaluative areas go proxy for non-factual practical ones. -/- . (shrink)

Models are indispensable tools of scientific inquiry, and one of their main uses is to improve our understanding of the phenomena they represent. How do models accomplish this? And what does this tell us about the nature of understanding? While much recent work has aimed at answering these questions, philosophers' focus has been squarely on models in empirical science. I aim to show that pure mathematics also deserves a seat at the table. I begin by presenting two cases: Cramér’s random (...) model of the prime numbers and the function field model of the integers. These cases show that mathematicians, like empirical scientists, rely on unrealistic models to gain understanding of complex phenomena. They also have important implications for some much-discussed theses about scientific understanding. First, modeling practices in mathematics confirm that one can gain understanding without obtaining an explanation. Second, these cases undermine the popular thesis that unrealistic models confer understanding by imparting counterfactual knowledge. (shrink)

In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof? -/- The answer is an emphatic yes, as I explain in this article. I argue that non-deductive justification is in fact pervasive in mathematics, and that it (...) is in good epistemic standing. (shrink)

In many diagrams one seems to perceive necessity – one sees not only that something is so, but that it must be so. That conflicts with a certain empiricism largely taken for granted in contemporary philosophy, which believes perception is not capable of such feats. The reason for this belief is often thought well-summarized in Hume's maxim: ‘there are no necessary connections between distinct existences’. It is also thought that even if there were such necessities, perception is too passive or (...) localized a faculty to register them. We defend the perception of necessity against such Humeanism, drawing on examples from mathematics. (shrink)

An Aristotelian Philosophy of Mathematics breaks the impasse between Platonist and nominalist views of mathematics. Neither a study of abstract objects nor a mere language or logic, mathematics is a science of real aspects of the world as much as biology is. For the first time, a philosophy of mathematics puts applied mathematics at the centre. Quantitative aspects of the world such as ratios of heights, and structural ones such as symmetry and continuity, are parts of the physical world and (...) are objects of mathematics. Though some mathematical structures such as infinities may be too big to be realized in fact, all of them are capable of being realized. Informed by the author's background in both philosophy and mathematics, but keeping to simple examples, the book shows how infant perception of patterns is extended by visualization and proof to the vast edifice of modern pure and applied mathematical knowledge. (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)

Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though some versions of mathematical instrumentalism (...) are defeated by Gödel’s theorem, not all are. By considering inductive reasons in mathematics, we show that some mathematical instrumentalisms survive the theorem. (shrink)

In this paper, I describe some aspects of the phenomenon of "experimental mathematics" in order to discuss whether it constitutes a subdiscipline or a particular style of mathematics. My conclusion is that neither of these notions accurately capture the complex culture of experimental mathematics.

In a series of papers, Don Fallis points out that although mathematicians are generally unwilling to accept merely probabilistic proofs, they do accept proofs that are incomplete, long and complicated, or partly carried out by computers. He argues that there are no epistemic grounds on which probabilistic proofs can be rejected while these other proofs are accepted. I defend the practice by presenting a property I call ‘transferability’, which probabilistic proofs lack and acceptable proofs have. I also consider what this (...) says about the similarities between mathematics and, on the one hand natural sciences, and on the other hand philosophy. (shrink)

This paper focuses on the distinction between methods which are mathematically "clever", and those which are simply crude, typically repetitive and computer intensive, approaches for "crunching" out answers to problems. Examples of the latter include simulated probability distributions and resampling methods in statistics, and iterative methods for solving equations or optimisation problems. Most of these methods require software support, but this is easily provided by a PC. The paper argues that the crunchier methods often have substantial advantages from the perspectives (...) of user-friendliness, reliability (in the sense that misuse is less likely), educational efficiency and realism. This means that they offer very considerable potential for simplifying the mathematical syllabus underlying many areas of applied mathematics such as management science and statistics: crunchier methods can provide the same, or greater, technical power, flexibility and insight, while requiring only a fraction of the mathematical conceptual background needed by their cleverer brethren. (shrink)