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)

This article analyses how normative decision theory is understood by economists. The paradigmatic example of normative decision theory, discussed in the article, is the expected utility theory. It...

This paper addresses the actual practice of justifying definitions in mathematics. First, I introduce the main account of this issue, namely Lakatos's proof-generated definitions. Based on a case study of definitions of randomness in ergodic theory, I identify three other common ways of justifying definitions: natural-world justification, condition justification, and redundancy justification. Also, I clarify the interrelationships between the different kinds of justification. Finally, I point out how Lakatos's ideas are limited: they fail to show how various kinds of justification (...) can be found and can be reasonable, and they fail to acknowledge the interplay among the different kinds of justification. (shrink)

In this paper, I introduce and examine the notion of “mathematical engineering” and its impact on mathematical change. Mathematical engineering is an important part of contemporary mathematics and it roughly consists of the “construction” and development of various machines, probes and instruments used in numerous mathematical fields. As an example of such constructions, I briefly present the basic steps and properties of homology theory. I then try to show that this aspect of contemporary mathematics has important consequences on our conception (...) of mathematical knowledge, in particular mathematical growth. (shrink)

In this paper I assess the obstacles to a transfer of Lakatos's methodology of scientific research programmes to mathematics. I argue that, if we are to use something akin to this methodology to discuss modern mathematics with its interweaving theoretical development, we shall require a more intricate construction and we shall have to move still further away from seeing mathematical knowledge as a collection of statements. I also examine the notion of rivalry within mathematics and claim that this appears to (...) be significant only at a high level. In addition, ideas of ‘progress’ in mathematics are outlined. (shrink)

The central idea of Lakatos’ quasi-empiricism view of the philosophy of mathematics is that truth values are transmitted bottom-up, but only falsity can be transmitted from basic statements. As it is falsity but not truth that flows bottom-up, Lakatos emphasizes that observation and induction play no role in both conjecturing and proving phases in mathematics. In this paper, I argue that Lakatos’ view that one cannot obtain primitive conjectures by induction contradicts the history of mathematics, and therefore undermines his quasi-empiricism (...) theory. I argue that his misconception of induction causes this view of Lakatos. Finally, I propose that Wittgenstein’s view that “mathematics does have a grammatical nature, but it is also rooted in empirical regularities” suggests the possibility to improve Lakatos’ view by maintaining his quasi-empiricism while accepting the role induction plays in the conjecturing phase. (shrink)

We argue that there are mutually beneficial connections to be made between ideas in argumentation theory and the philosophy of mathematics, and that these connections can be suggested via the process of producing computational models of theories in these domains. We discuss Lakatos’s work (Proofs and Refutations, 1976) in which he championed the informal nature of mathematics, and our computational representation of his theory. In particular, we outline our representation of Cauchy’s proof of Euler’s conjecture, in which we use work (...) by Haggith on argumentation structures, and identify connections between these structures and Lakatos’s methods. (shrink)

The late Imre Lakatos once hoped to found a school of dialectical philosophy of mathematics. The aim of this paper is to ask what that might possibly mean. But Lakatos's philosophy has serious shortcomings. The paper elaborates a conception of dialectical philosophy of mathematics that repairs these defects and considers the work of three philosophers who in some measure fit the description: Yehuda Rav, Mary Leng and David Corfield.

Lakatos's Proofs and Refutations is usually understood as an attempt to apply Popper's methodology of science to mathematics. This view has been challenged because despite appearances the methodology expounded in it deviates considerably from what would have been a straightforward application of Popperian maxims. I take a closer look at the Popperian roots of Lakatos's philosophy of mathematics, considered not as an application but as an extension of Popper's critical programme, and focus especially on the core ideas of this programme (...) as they appeared where Popper specifically addressed philosophical problems concerning mathematics. (shrink)