The general theme of this article is the actual practice of how definitions are justified and formulated in mathematics. The theoretical insights of this article are based on a case study of topological definitions of chaos. After introducing this case study, I identify the three kinds of justification which are important for topological definitions of chaos: natural-world-justification, condition-justification and redundancy-justification. To my knowledge, the latter two have not been identified before. I argue that these three kinds of justification are widespread (...) in mathematics. After that, I first discuss the state of the art in the literature about the justification of definitions in the light of actual mathematical practice. I then go on to criticize Lakatos’s account of proof-generated definitions—the main account in the literature on this issue—as being limited and also misguided: as for topological definitions of chaos, in nearly all mathematical fields various kinds of justification are found and are also reasonable. (shrink)

Charles Peirce's diagrammatic logic — the Existential Graphs — is presented as a tool for illuminating how we know necessity, in answer to Benacerraf's famous challenge that most ‘semantics for mathematics’ do not ‘fit an acceptable epistemology’. It is suggested that necessary reasoning is in essence a recognition that a certain structure has the particular structure that it has. This means that, contra Hume and his contemporary heirs, necessity is observable. One just needs to pay attention, not merely to individual (...) things but to how those things are related in larger structures, certain aspects of which relations force certain other aspects to be a certain way. (shrink)

Let's begin with an old example. In De Rerum Naturua , Lucretius presented a thought experiment to show that space is infinite. We imagine ourselves near the alleged edge of space; we throw a spear; we see it either sail through the ‘edge’ or we see it bounce back. In the former case the ‘edge’ isn't the edge, after all. In the latter case, there must be something beyond the ‘edge’ that repelled the spear. Either way, the ‘edge’ isn't really (...) an edge of space, after all. So space is infinite. (shrink)

This article discusses the role of diagrams in mathematical reasoning in the light of a case study in analysis. In the example presented certain combinatorial expressions were first found by using diagrams. In the published proofs the pictures were replaced by reasoning about permutation groups. This article argues that, even though the diagrams are not present in the published papers, they still play a role in the formulation of the proofs. It is shown that they play a role in concept (...) formation as well as representations of proofs. In addition we note that 'visualization' is used in two different ways. In the first sense 'visualization' denotes our inner mental pictures, which enable us to see that a certain fact holds, whereas in the other sense 'visualization' denotes a diagram or representation of something. (shrink)

Philosophers who regard some mathematical proofs as explaining why theorems hold, and others as merely proving that they do hold, disagree sharply about the explanatory value of proofs by mathematical induction. I offer an argument that aims to resolve this conflict of intuitions without making any controversial presuppositions about what mathematical explanations would be.

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)

Two experiments are reported which investigate the factors that influence how persuaded mathematicians are by visual arguments. We demonstrate that if a visual argument is accompanied by a passage of text which describes the image, both research-active mathematicians and successful undergraduate mathematics students perceive it to be significantly more persuasive than if no text is given. We suggest that mathematicians’ epistemological concerns about supporting a claim using visual images are less prominent when the image is described in words. Finally we (...) suggest that empirical studies can make a useful contribution to our understanding of mathematical practice. (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)

ABSTRACT This paper reveals David Hilbert’s position in the philosophy of mathematics, circa 1900, to be a form of non-eliminative structuralism, predating his formalism. I argue that Hilbert withstands the pressing objections put to him by Frege in the course of the Frege-Hilbert controversy in virtue of this early structuralist approach. To demonstrate that this historical position deserves contemporary attention I show that Hilbertian structuralism avoids a recent wave of objections against non-eliminative structuralists to the effect that they cannot distinguish (...) between structurally identical but importantly distinct mathematical objects, such as the complex roots of $-1$. (shrink)

Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic logic in particular, buttressed (...) by assertion-conditional semantics, is often considered to enjoy a degree of meaning-theoretical respectability unattainable by classical logic.The decision to forgo the classical inference rules is not always made lightly. Thus, Dummett: " In the resolution of the conflict between [the view that generally accepted classical modes of inference ought to be theoretically accommodated, and the demand that any such accommodation be achieved without recourse to bivalence] lies, as I see it, one of the most fundamental and intractable problems in the theory of meaning; indeed, in all philosophy. "The present article ventures to suggest that the conflict need not be irresoluble. Helping ourselves only to such conceptual resources as are standardly invoked by proponents of intuitionistic logic, we shall formulate a rudimentary meaning theory for a selection of logical constants, define a relation of valid inferability, and prove that the latter includes all of classical first-order logic. The result is essentially that reported in Sandqvist as Theorem 2.20.2. TheoryWe will be considering a standard-syntax first-order language with ⊃, ⊥ and ∀ as its only primitive logical constants. We assume countable supplies of individual constants, individual functors , and predicates , as well as a denumerably infinite set of individual variables. By a basic 1 formula we will mean one that …[Full Text of this Article]. (shrink)

In discussions about whether the Principle of the Identity of Indiscernibles is compatible with structuralist ontologies of mathematics, it is usually assumed that individual objects are subject to criteria of identity which somehow account for the identity of the individuals. Much of this debate concerns structures that admit of non-trivial automorphisms. We consider cases from graph theory that violate even weak formulations of PII. We argue that (i) the identity or difference of places in a structure is not to be (...) accounted for by anything other than the structure itself and that (ii) mathematical practice provides evidence for this view. We want to thank Leon Horsten, Jeff Ketland, Øystein Linnebo, John Mayberry, Richard Pettigrew, and Philip Welch for valuable comments on drafts of this paper. We are especially grateful to Fraser MacBride for correcting our interpretation of two of his papers and for other helpful comments. CiteULike Connotea Del.icio.us What's this? (shrink)

I examine what I take to be an important consideration for the later Wittgenstein: the understanding of a rule does not exceed or transcend an understanding of explanations or instructions in the rule. I contend that this consideration plays a central role in the later Wittgenstein's views on rule-following. I first show that it serves as a key premiss in a sceptical argument concerning our ability to follow rules. I then argue that this consideration is vital to Wittgenstein's case against (...) what I describe as a realist view of rules. This realist view requires that our understanding of a rule extend beyond what can be understood from any set of instructions or explanation. For Wittgenstein, because this is to transcend publicly available means of conveying understanding, this realist's understanding is a private understanding. He calls this private source of understanding an ‘intuition’ and the main line of argument against intuition in our understanding of a rule draws, appropriately, on what is called his ‘private language argument’. In this paper, I defend a non-verificationist reading of this argument and its use against the realist so-construed. CiteULike Connotea Del.icio.us What's this? (shrink)

Electronic computers form an integral part of modern mathematical practice. Several high-profile results have been proven with techniques where computer calculations form an essential part of the proof. In the traditional philosophical literature, such proofs have been taken to constitute a posteriori knowledge. However, this traditional stance has recently been challenged by Mark McEvoy, who claims that computer calculations can constitute a priori mathematical proofs, even in cases where the calculations made by the computer are too numerous to be surveyed (...) by human agents. In this article we point out the deficits of the traditional literature that has called for McEvoy’s correction. We also explain why McEvoy’s defence of mathematical apriorism fails and we discuss how the debate over the epistemological status of computer-assisted mathematics contains several unfortunate conceptual reductions. (shrink)