The general question considered is whether and to what extent there are features of our mathematical knowledge that support a realist attitude towards mathematics. I consider, in particular, reasoning from claims such as that mathematicians believe their reasoning to be part of a process of discovery (and not of mere invention), to the view that mathematical entities exist in some mind-independent way although our minds have epistemic access to them.

Mathematics used to be portrayed as a deductive science. Stemming from Polya, however, is a philosophical movement which broadens the concept of mathematical reasoning to include inductive or quasi-empirical methods. Interest in inductive methods is a welcome turn from foundationalism toward a philosophy grounded in mathematical practice. Regrettably, though, the conception of mathematical reasoning embraced by quasi-empiricists is still too narrow to include the sort of thought-experiment which Mueller describes as traditional mathematical proof and which Lakatos examines in Proofs and (...) refutations. This paper extends the concept of mathematical reasoning along two further dimensions to accommodate thought-experiment.Keywords: Thought-experiment; Informal proof; Mathematical reasoning. (shrink)

Recently, certain philosophers of mathematics (Fallis [1997]; Womack and Farach [(1997]) have argued that there are no epistemic considerations that should stop mathematicians from using probabilistic methods to establish that mathematical propositions are true. However, mathematicians clearly should not use methods that are unreliable. Unfortunately, due to the fact that randomized algorithms are not really random in practice, there is reason to doubt their reliability. In this paper, I analyze the prospects for establishing that randomized algorithms are reliable. I end (...) by arguing that it would be inconsistent for mathematicians to suspend judgement on the truth of mathematical propositions on the basis of worries about the reliability of randomized algorithms. (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)

Mathematicians do not claim to know a proposition unless they think they possess a proof of it. For all their confidence in the truth of a proposition with weighty non-deductive support, they maintain that, strictly speaking, the proposition remains unknown until such time as someone has proved it. This article challenges this conception of knowledge, which is quasi-universal within mathematics. We present four arguments to the effect that non-deductive evidence can yield knowledge of a mathematical proposition. We also show that (...) some of what mathematicians take to be deductive knowledge is in fact non-deductive. 1 Introduction2 Why It Might Matter3 Two Further Examples and Preliminaries4 An Exclusive Epistemic Virtue of Proof?5 Analyses of Knowledge6 The Inductive Basis of Deduction7 Physical to Mathematical Linkages8 Conclusion. (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)

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)

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)

Several philosophers have used the framework of means/ends reasoning to explain the methodological choices made by scientists and mathematicians (see, e.g., Goldman 1999, Levi 1962, Maddy 1997). In particular, they have tried to identify the epistemic objectives of scientists and mathematicians that will explain these choices. In this paper, the framework of means/ends reasoning is used to study an important methodological choice made by mathematicians. Namely, mathematicians will only use deductive proofs to establish the truth of mathematical claims. In this (...) paper, I argue that none of the epistemic objectives of mathematicians that are currently on the table provide a satisfactory explanation of this rejection of probabilistic proofs. (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)

This is the first interdisciplinary exploration of the philosophical foundations of the Web, a new area of inquiry that has important implications across a range of domains. - Contains twelve essays that bridge the fields of philosophy, cognitive science, and phenomenology. - Tackles questions such as the impact of Google on intelligence and epistemology, the philosophical status of digital objects, ethics on the Web, semantic and ontological changes caused by the Web, and the potential of the Web to serve as (...) a genuine cognitive extension. - Brings together insightful new scholarship from well-known analytic and continental philosophers, such as Andy Clark and Bernard Stiegler, as well as rising scholars in “digital native” philosophy and engineering. - Includes an interview with Tim Berners-Lee, the inventor of the Web. (shrink)

The Web may critically transform the way we understand the activity of proving. The Web as a collaborative medium allows the active participation of people with different backgrounds, interests, viewpoints, and styles. Mathematical formal proofs are inadequate for capturing Web-based proofs. This article claims that Web provings can be studied as a particular type of Goguen's proof-events. Web-based proof-events have a social component, communication medium, prover-interpreter interaction, interpretation process, understanding and validation, historical component, and styles. To demonstrate its claim, the (...) article discusses the Kumo and Polymath projects, both of which employ Web-based communication as part of proving. Web proving is a novel type of proving activity that may have a serious impact on the change in mathematical practices, despite the fact that it is not currently a universally acceptable methodology. (shrink)

The style of arithmetic in the treatises the Neo-Pythagorean authors is strikingly different from that of the "Elements". Namely, it is characterised by the absence of proof in the Euclidean sense and a specific genetic approach to the construction of arithmetic that we are going to describe in our paper. Lack of mathematical sophistication has led certain historians to consider this type of mathematics as a feature of decadence of mathematics in this period [Tannery 1887; Heath 1921]. The alleged absence (...) of originality in these works has also given grounds to believe that “the arithmetic presented in these works derives substantially from an ancient, primitive stage of Pythagorean arithmetic” and to use them as “an index of the character of arithmetic science in the 5th century” [Knorr 1975]. In this paper, we take Nicomachus’ Introduction to Arithmetic for point of departure, because it is the richest and most well organised treatise representing this tradition. However, we also take into account the works of other Neo-Pythagorean authors. We are going to show that the Neo-Pythagorean arithmetic might have been developed in a natural, self-contained manner as a simple theory of counting over a domain of concrete initial objects, designated by fixed signs. This approach can be comfortably realised without appealing to assumptions of axiomatic character, but relying upon some ‘genetic’ constructions intented to be carried out by means of the designated entities. (shrink)

Mistaken reasons for thinking diagrammatic proofs aren't rigorous are explored. The main result is that a confusion between the contents of a proof procedure (what's expressed by the referential elements in a proof procedure) and the unarticulated mathematical aspects of a proof procedure (how that proof procedure is enabled) gives the impression that diagrammatic proofs are less rigorous than language proofs. An additional (and independent) factor is treating the impossibility of naturally generalizing a diagrammatic proof procedure as an indication of (...) lack of rigor. (shrink)

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)

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 Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

Here the author of How to Solve It explains how to become a "good guesser." Marked by G. Polya's simple, energetic prose and use of clever examples from a wide range of human activities, this two-volume work explores techniques of guessing, inductive reasoning, and reasoning by analogy, and the role they play in the most rigorous of deductive disciplines.

Several high-profile mathematical problems have been solved in recent decades by computer-assisted proofs. Some philosophers have argued that such proofs are a posteriori on the grounds that some such proofs are unsurveyable; that our warrant for accepting these proofs involves empirical claims about the reliability of computers; that there might be errors in the computer or program executing the proof; and that appeal to computer introduces into a proof an experimental element. I argue that none of these arguments withstands scrutiny, (...) and so there is no reason to believe that computer-assisted proofs are not a priori. Thanks are due to Michael Levin, David Corfield, and an anonymous referee for Philosophia Mathematica for their helpful comments. Earlier versions of this paper were presented at the Hofstra University Department of Mathematics colloquium series, and at the 2005 New Jersey Regional Philosophical Association; I am grateful to both audiences for their comments. CiteULike Connotea Del.icio.us What's this? (shrink)