The initial motivating question for this thesis is what the standard of rigour in modern mathematics amounts to: what makes a proof rigorous, or fail to be rigorous? How is this judged? A new account of rigour is put forward, aiming to go some way to answering these questions. Some benefits of the norm of rigour on this account are discussed. The account is contrasted with other remarks that have been made about mathematical proof and its workings, and is tested (...) and illustrated by considering a case study discussed in the literature. On the view put forward here one can obtain a manner of informal, rigorous mathematics founded on any of a variety of proof systems. The latter part of the thesis is concerned with the question of how we should decide which of these competing proof systems we should base our mathematics on: i.e., the question of which proof system we should take as a foundation for our mathematics. A novel answer to this question is proposed, in which the key property we should require of a proof system is that for as many different kinds of structures as possible, when the proof system allows a generalization about that kind of structure to be proved, the generalization actually holds of all real examples of that kind of structure which exist. This is the requirement of soundness of the proof system. It is argued that the best way to establish the soundness of a proof system may be by giving an interpretation of its axioms on which they are established as true. As preparation for this discussion, the thesis first investigates the logical and conceptual basis of various arithmetic concepts, with the results obtained used in the final discussion of soundness. (shrink)

According to the received view, genuine mathematical justification derives from proofs. In this article, I challenge this view. First, I sketch a notion of proof that cannot be reduced to deduction from the axioms but rather is tailored to human agents. Secondly, I identify a tension between the received view and mathematical practice. In some cases, cognitively diligent, well-functioning mathematicians go wrong. In these cases, it is plausible to think that proof sets the bar for justification too high. I then (...) propose a fallibilist account of mathematical justification. I show that the main function of mathematical justification is to guarantee that the mathematical community can correct the errors that inevitably arise from our fallible practices. (shrink)

There are different narratives on mathematics as part of our world, some of which are more appropriate than others. Such narratives might be of the form ‘Mathematics is useful’, ‘Mathematics is beautiful’, or ‘Mathematicians aim at theorem-credit’. These narratives play a crucial role in mathematics education and in society as they are influencing people’s willingness to engage with the subject or the way they interpret mathematical results in relation to real-world questions; the latter yielding important normative considerations. Our strategy is (...) to frame current narratives of mathematics from a virtue-theoretic perspective. We identify the practice of mathematizing, put forward by Freudenthal’s ‘Realistic mathematics education’, as virtuous and use it to evaluate different narratives. We show that this can help to render the narratives more adequately, and to provide implications for societal organization. (shrink)

Criteria of acceptability for mathematical proofs are field-dependent. In topology, though not in most other domains, it is sometimes acceptable to appeal to visual intuition to support inferential steps. In previous work :829–842, 2014; Lolli, Panza, Venturi From logic to practice, Springer, Berlin, 2015; Larvor Mathematical cultures, Springer, Berlin, 2016) my co-author and I aimed at spelling out how topological proofs work on their own terms, without appealing to formal proofs which might be associated with them. In this article, I (...) address two criticisms that have been raised in Tatton-Brown against our approach: that it leads to a form of relativism according to which validity is equated with social agreement and that it implies an antiformalizability thesis according to which it is not the case that all rigorous mathematical proofs can be formalized. I reject both criticisms and suggest that our previous case studies provide insight into the plausibility of two related but quite different theses. (shrink)

In recent years, philosophical work directly concerned with the practice of mathematics has intensified, giving rise to a movement known as the philosophy of mathematical practice . In this paper we offer a survey of this movement aimed at mathematics educators. We first describe the core questions philosophers of mathematical practice investigate as well as the philosophical methods they use to tackle them. We then provide a selective overview of work in the philosophy of mathematical practice covering topics including the (...) distinction between formal and informal proofs, visualization and artefacts, mathematical explanation and understanding, value judgments, and mathematical design. We conclude with some remarks on the potential connections between the philosophy of mathematical practice and mathematics education. (shrink)

The role of audiences in mathematical proof has largely been neglected, in part due to misconceptions like those in Perelman and Olbrechts-Tyteca which bar mathematical proofs from bearing reflections of audience consideration. In this paper, I argue that mathematical proof is typically argumentation and that a mathematician develops a proof with his universal audience in mind. In so doing, he creates a proof which reflects the standards of reasonableness embodied in his universal audience. Given this framework, we can better understand (...) the introduction of proof methods based on the mathematician’s likely universal audience. I examine a case study from Alexander and Briggs’s work on knot invariants to show that we can fruitfully reconstruct mathematical methods in terms of audiences. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

Of all the demands that mathematics imposes on its practitioners, one of the most fundamental is that proofs ought to be correct. It has been common since the turn of the twentieth century to take correctness to be underwritten by the existence of formal derivations in a suitable axiomatic foundation, but then it is hard to see how this normative standard can be met, given the differences between informal proofs and formal derivations, and given the inherent fragility and complexity of (...) the latter. This essay describes some of the ways that mathematical practice makes it possible to reliably and robustly meet the formal standard, preserving the standard normative account while doing justice to epistemically important features of informal mathematical justification. (shrink)

Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer.

Abstract In the new millennium there have been important empirical developments in the philosophy of mathematics. One of these is the so-called “Empirical Philosophy of Mathematics”(EPM) of Buldt, Löwe, Müller and Müller-Hill, which aims to complement the methodology of the philosophy of mathematics with empirical work. Among other things, this includes surveys of mathematicians, which EPM believes to give philosophically important results. In this paper I take a critical look at the sociological part of EPM as a case study of (...) ... (shrink)

This paper presents examples of infinite diagrams whose use is more or less essential for understanding and accepting various proofs in higher mathematics. The significance of these is discussed with respect to the thesis that every proof can be formalized, and a “pre” form of this thesis that every proof can be presented in everyday statements-only form.

Derivationists, those wishing to explain the correctness and rigour of informal proofs in terms of associated formal proofs, are generally held to be supported by the success of the project of translating informal proofs into computer-checkable formal counterparts. I argue, however, that this project is a false friend for the derivationists because there are too many different associated formal proofs for each informal proof, leading to a serious worry of overgeneration. I press this worry primarily against Azzouni's derivation-indicator account, but (...) conclude that overgeneration is a major obstacle to a successful account of informal proofs in this direction. (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)

Written by experts in the field, this volume presents a comprehensive investigation into the relationship between argumentation theory and the philosophy of mathematical practice. Argumentation theory studies reasoning and argument, and especially those aspects not addressed, or not addressed well, by formal deduction. The philosophy of mathematical practice diverges from mainstream philosophy of mathematics in the emphasis it places on what the majority of working mathematicians actually do, rather than on mathematical foundations. -/- The book begins by first challenging the (...) assumption that there is no role for informal logic in mathematics. Next, it details the usefulness of argumentation theory in the understanding of mathematical practice, offering an impressively diverse set of examples, covering the history of mathematics, mathematics education and, perhaps surprisingly, formal proof verification. From there, the book demonstrates that mathematics also offers a valuable testbed for argumentation theory. Coverage concludes by defending attention to mathematical argumentation as the basis for new perspectives on the philosophy of mathematics. ​. (shrink)

The formalist point of view maintains that formal derivations underlying proofs, although usually not carried out in practice, contribute to the confidence in mathematical theorems. Opposing this opinion, the main claim of the present paper is that such a gain of confidence obtained from any link between proofs and formal derivations is, even in principle, impossible in the present state of knowledge. Our argument is based on considerations concerning length of formal derivations. Thanks to Jody Azzouni for enlightening discussions concerning (...) the subject of this paper and to anonymous referees whose important remarks permitted us to correct the arguments and improve presentation. The remaining flaws remain, of course, solely the responsibility of the author. This research was partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais. CiteULike Connotea Del.icio.us What's this? (shrink)

Some authors have begun to appeal directly to studies of argumentation in their analyses of mathematical practice. These include researchers from an impressively diverse range of disciplines: not only philosophy of mathematics and argumentation theory, but also psychology, education, and computer science. This introduction provides some background to their work.

In this paper, I assume, perhaps controversially, that translation into a language of formal logic is not the method by which mathematicians assess mathematical reasoning. Instead, I argue that the actual practice of analyzing, evaluating and critiquing mathematical reasoning resembles, and perhaps equates with, the practice of informal logic or argumentation theory. It doesn’t matter whether the reasoning is a full-fledged mathematical proof or merely some non-deductive mathematical justification: in either case, the methodology of assessment overlaps to a large extent (...) with argument assessment in non-mathematical contexts. I demonstrate this claim by considering the assessment of axiomatic or deductive proofs, probabilistic evidence, computer-aided proofs, and the acceptance of axioms. I also consider Jody Azzouni’s ‘derivation indicator’ view of proofs because it places derivations—which may be thought to invoke formal logic—at the center of mathematical justificatory practice. However, when the notion of ‘derivation’ at work in Azzouni’s view is clarified, it is seen to accord with, rather than to count against, the informal logical view I support. Finally, I pose several open questions for the development of a theory of mathematical argument. (shrink)

If mathematics is regarded as a science, then the philosophy of mathematics can be regarded as a branch of the philosophy of science, next to disciplines such as the philosophy of physics and the philosophy of biology. However, because of its subject matter, the philosophy of mathematics occupies a special place in the philosophy of science. Whereas the natural sciences investigate entities that are located in space and time, it is not at all obvious that this is also the case (...) with respect to the objects that are studied in mathematics. In addition to that, the methods of investigation of mathematics differ markedly from the methods of investigation in the natural sciences. Whereas the latter acquire general knowledge using inductive methods, mathematical knowledge appears to be acquired in a different way, namely, by deduction from basic principles. The status of mathematical knowledge also appears to differ from the status of knowledge in the natural sciences. The theories of the natural sciences appear to be less certain and more open to revision than mathematical theories. For these reasons mathematics poses problems of a quite distinctive kind for philosophy. Therefore philosophers have accorded special attention to ontological and epistemological questions concerning mathematics. (shrink)

The frame concept from linguistics, cognitive science and artificial intelligence is a theoretical tool to model how explicitly given information is combined with expectations deriving from background knowledge. In this paper, we show how the frame concept can be fruitfully applied to analyze the notion of mathematical understanding. Our analysis additionally integrates insights from the hermeneutic tradition of philosophy as well as Schmid’s ideal genetic model of narrative constitution. We illustrate the practical applicability of our theoretical analysis through a case (...) study on extremal proofs. Based on this case study, we compare our analysis of proof understanding to Avigad’s ability-based analysis of proof understanding. (shrink)

In this paper, we explore the role of syntactic representations in set theory. We highlight a common inferential scheme in set theory, which we call the Syntactic Representation Inferential Scheme, in which the set theorist infers information about a concept based on the way that concept can be represented syntactically. However, the actual syntactic representation is only indicated, not explicitly provided. We consider this phenomenon in relation to the derivation indicator position that asserts that the ordinary proofs given in mathematical (...) discourse indicate syntactic derivations in a formal logical system. In particular, we note that several of the arguments against the derivation indicator position would seem to imply that set theorists could gain no benefits from the syntactic representations of concepts indicated by their definitions, yet set theorists clearly do. (shrink)

Mathematicians often intentionally leave gaps in their proofs. Based on interviews with mathematicians about their refereeing practices, this paper examines the character of intentional gaps in published proofs. We observe that mathematicians’ refereeing practices limit the number of certain intentional gaps in published proofs. The results provide some new perspectives on the traditional philosophical questions of the nature of proof and of what grounds mathematical knowledge.

Formalism shares with nominalism a distaste for _abstracta_. But an honest exposition of the former position risks introducing _abstracta_ as the stuff of syntax. This article describes the dangers, and offers a new escape route from platonism for the formalist. It is explained how the needed role of derivations in mathematical practice can be explained, not by a commitment to the derivations themselves, but by the commitment of the mathematician to a practice which is in accord with a theory of (...) derivations. (shrink)

The view that a mathematical proof is a sketch of or recipe for a formal derivation requires the proof to function as an argument that there is a suitable derivation. This is a mathematical conclusion, and to avoid a regress we require some other account of how the proof can establish it.

Mathematical rigor is commonly formulated by mathematicians and philosophers using the notion of proof gap: a mathematical proof is rig­orous when there is no gaps in the mathematical reasoning of the proof. Any philosophical approach to mathematical rigor along this line requires then an account of what a proof gap is. However, the notion of proof gap makes sense only relatively to a given conception of valid mathematical reasoning, i.e., to a given conception of the validity of mathematical inference. A (...) proof gap can in particular be conceived as a failure in drawing a valid mathematical inference. The aim of this paper is to discuss two possible views of the validity of math­ematical inference with respect to their capacity to yield a plausible account of the intuitive notion(s) of proof gap present in mathematical practice. The first view is the one provided by the contemporary standards of mathematical rigor: a mathematical inference is valid if and only if its conclusion can be formally derived from its premises. We will argue that this conception does not lead to a plausible account of the intuitive notion(s) of proof gap. The second view is based on a new account of the validity of inference proposed by Prawitz: an inference is valid if and only if it consists in an operation that provides a ground for its conclusion given (previously obtained) grounds for its premises. We will first specify Prawitz's account to mathematical inference and we will then argue that the resulting ground-based account is able to capture various intuitive notions of proof gap as different types of failure in drawing valid mathematical inferences. We conclude that the ground-based account ap­pears of particular interest for the philosophy of mathematical practice, and we finally raise several challenges facing a full development of a ground-based account of the notions of mathematical rigor, proof gap and the validity of mathematical inference. (shrink)

Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With respect to the proofs in the Elements in particular, the received view is that Euclid's reliance on geometric diagrams undermines his efforts to develop a gap-free deductive theory. The central difficulty concerns the generality of the theory. How can inferences made from a particular diagrams license general mathematical results? After surveying the history behind the received (...) view, this essay provides a contrary analysis by introducing a formal account of Euclid's proofs, termed Eu. Eu solves the puzzle of generality surrounding Euclid's arguments. It specifies what diagrams Euclid's diagrams are, in a precise formal sense, and defines generality-preserving proof rules in terms of them. After the central principles behind the formalization are laid out, its implications with respect to the question of what does and does not constitute a genuine picture proof are explored. (shrink)

Yet, he also says that it is philosophically indeterminate which criterion for what exists is correct. Nominalism is the view that certain objects ( i.e ., abstract objects) do not exist, and not the view that it is philosophically indeterminate whether or not they do. I resolve the dilemma that Azzouni's claims pose: Azzouni is a non-factualist about what exists, but he is a factualist about which criterion for what exists our community of speakers has adopted. It is in the (...) latter sense only that Azzouni can call himself a nominalist. My thanks to Jody Azzouni and to an anonymous referee for helpful suggestions. CiteULike Connotea Del.icio.us What's this? (shrink)

Kant discovered a philosophical problem with mathematical proof. Despite being a priori , its methodology involves more than analytic truth. But what else is involved? This problem is widely taken to have been solved by Frege’s extension of logic beyond its restricted (and largely Aristotelian) form. Nevertheless, a successor problem remains: both traditional and contemporary (classical) mathematical proofs, although conforming to the norms of contemporary (classical) logic, never were, and still aren’t, executed by mathematicians in a way that transparently reveals (...) why these proofs—written in the vernacular to this very day—succeed in conforming to those norms. (shrink)

In a 2022 paper, Hamami claimed that the orthodox view in mathematics is that a proof is rigorous if it can be translated into a derivation. Hamami then developed a descriptive account that explains how mathematicians check proofs for rigor in this sense and how they develop the capacity to do so. By exploring introductory texts in computability theory, we demonstrate that Hamami’s descriptive account does not accord with actual mathematical practice with respect to computability theory. We argue instead for (...) an alternative account in which imagination, anticipation, and interpretations of natural language play roles in establishing mathematical rigor. (shrink)

Open texture is a kind of semantic indeterminacy first systematically studied by Waismann. In this paper, extant definitions of open texture will be compared and contrasted, with a view towards the consequences of open-textured concepts in mathematics. It has been suggested that these would threaten the traditional virtues of proof, primarily the certainty bestowed by proof-possession, and this suggestion will be critically investigated using recent work on informal proof. It will be argued that informal proofs have virtues that mitigate the (...) danger posed by open texture. Moreover, it will be argued that while rigor in the guise of formalisation and axiomatisation might banish open texture from mathematical theories through implicit definition, it can do so only at the cost of restricting the tamed concepts in certain ways. (shrink)

This paper puts forward a new account of rigorous mathematical proof and its epistemology. One novel feature is a focus on how the skill of reading and writing valid proofs is learnt, as a way of understanding what validity itself amounts to. The account is used to address two current questions in the literature: that of how mathematicians are so good at resolving disputes about validity, and that of whether rigorous proofs are necessarily formalizable.

ABSTRACTIn this paper I investigate how conceptual engineering applies to mathematical concepts in particular. I begin with a discussion of Waismann’s notion of open texture, and compare it to Shapiro’s modern usage of the term. Next I set out the position taken by Lakatos which sees mathematical concepts as dynamic and open to improvement and development, arguing that Waismann’s open texture applies to mathematical concepts too. With the perspective of mathematics as open-textured, I make the case that this allows us (...) to deploy the tools of conceptual engineering in mathematics. I will examine Cappelen’s recent argument that there are no conceptual safe spaces and consider whether mathematics constitutes a counterexample. I argue that it does not, drawing on Haslanger’s distinction between manifest and operative concepts, and applying this in a novel way to set-theoretic foundations. I then set out some of the questions that need to be engaged with to establish mathematics as involving a kind of conceptual engineering. I finish with a case study of how the tools of conceptual engineering will give us a way to progress in the debate between advocates of the Universe view and the Multiverse view in set theory. (shrink)

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as a (...) necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain. (shrink)

In this paper, we discuss the prevailing view amongst philosophers and many mathematicians concerning mathematical proof. Following Cellucci, we call the prevailing view the “axiomatic conception” of proof. The conception includes the ideas that: a proof is finite, it proceeds from axioms and it is the final word on the matter of the conclusion. This received view can be traced back to Frege, Hilbert and Gentzen, amongst others, and is prevalent in both mathematical text books and logic text books.

In a recent article, Azzouni has argued in favor of a version of formalism according to which ordinary mathematical proofs indicate mechanically checkable derivations. This is taken to account for the quasi-universal agreement among mathematicians on the validity of their proofs. Here, the author subjects these claims to a critical examination, recalls the technical details about formalization and mechanical checking of proofs, and illustrates the main argument with aanalysis of examples. In the author's view, much of mathematical reasoning presents genuine (...) meaning-dependent mathematical characteristics that cannot be captured by formal calculi. ‘…there is a conflict between mathematical practice and the formalist doctrine.’ [Kreisel, 1969, p. 39]. (shrink)

Jody Azzouni argues that whilst it is indeterminate what the criteria for existence are, there is a criterion that has been collectively adopted to use ‘exist’ that we can employ to argue for positions in ontology. I raise and defend a novel objection to Azzouni: his view has the counterintuitive consequence that the facts regarding what exists can and will change when users of the word ‘exist’ change what criteria they associate with its usage. Considering three responses, I argue Azzouni (...) has best reason to take one that ultimately renders unsuccessful his arguments against mathematical abstracta. (shrink)

The pluralist sheds the more traditional ideas of truth and ontology. This is dangerous, because it threatens instability of the theory. To lend stability to his philosophy, the pluralist trades truth and ontology for rigour and other ‘fixtures’. Fixtures are the steady goal posts. They are the parts of a theory that stay fixed across a pair of theories, and allow us to make translations and comparisons. They can ultimately be moved, but we tend to keep them fixed temporarily. Apart (...) from considering rigour of proof as a fixture, I discuss fixed models, invariant notions and fixed information about objects across theories. There are other fixtures, but it is enough to start with these. (shrink)

Classical logic of formal provability includes Löb’s theorem, but not reflection. In contrast, intuitions about the inferential behavior of informal provability (in informal mathematics) seem to invalidate Löb’s theorem and validate reflection (after all, the intuition is, whatever mathematicians prove holds!). We employ a non-deterministic many-valued semantics and develop a modal logic T-BAT of an informal provability operator, which indeed does validate reflection and invalidates Löb’s theorem. We study its properties and its relation to known provability-related paradoxical arguments. We also (...) argue that T-BAT is a fairly sensible candidate for a formal logic of informal provability. (shrink)

In my () I argued that a central component of mathematical practice is that published proofs must be “transferable” — that is, they must be such that the author's reasons for believing the conclusion are shared directly with the reader, rather than requiring the reader to essentially rely on testimony. The goal of this paper is to explain this requirement of transferability in terms of a more general norm on defeat in mathematical reasoning that I will call “convertibility”. I begin (...) by discussing two types of epistemic defeat: “rebutting” and “undercutting”. I give examples of both of these kinds of defeat from the history of mathematics. I then argue that an important requirement in mathematics is that published proofs be detailed enough to allow the conversion of rebutting defeat into undercutting defeat. Finally, I show how this sort of convertibility explains the requirement of transferability, and contributes to the way mathematics develops by the pattern referred to by Lakatos () as “lemma incorporation”. (shrink)

Nous examinons les conditions de vérité pour des attributions de savoir dans le cas des connaissances mathématiques. La disposition d’une démonstration formalisable semble être un critère naturel :(*) X sait que p est vrai si et seulement si X en principe dispose d’une démonstration formalisable pour p.La formalisabilité pourtant ne joue pas un grand rôle dans la pratique mathématique effective. Nous présentons des résultats d’une recherche empirique qui indiquent que les mathématiciens n’employent pas certaines spécifications de (*) quand ils attribuent (...) du savoir. De plus, nous montrons que le concept de savoir mathématique qui est à la base de l’emploi effectif du mot « savoir » de la pratique mathématique est tout à fait compatible avec certaines intuitions philosophiques mais apparaît comme différent des concepts philosophiques formant la base de (*). (shrink)

This paper proposes an account of mathematical reasoning as parallel in structure: the arguments which mathematicians use to persuade each other of their results comprise the argumentational structure; the inferential structure is composed of derivations which offer a formal counterpart to these arguments. Some conflicts about the foundations of mathematics correspond to disagreements over which steps should be admissible in the inferential structure. Similarly, disagreements over the admissibility of steps in the argumentational structure correspond to different views about mathematical practice. (...) The latter steps may be analysed in terms of argumentation schemes. Three broad types of scheme are distinguished, a distinction which is then used to characterize and evaluate four contrasting approaches to mathematical practice. (shrink)

In his introductory paper to first-order logic, Jon Barwise writes in the Handbook of Mathematical Logic :[T]he informal notion of provable used in mathematics is made precise by the formal notion provable in first-order logic. Following a sug[g]estion of Martin Davis, we refer to this view as Hilbert’s Thesis.This paper reviews the discussion of Hilbert’s Thesis in the literature. In addition to the question whether it is justifiable to use Hilbert’s name here, the arguments for this thesis are compared with (...) those for Church’s Thesis concerning computability. This leads to the question whether one could provide an analogue for proofs of the concept of partial recursive function. (shrink)

Post-war argumentation theorists have tended to regard argumentation as one thing and mathematical proof as another. Perelman (1958, 1969), for example, defined the word ‘argumentation’ stipulatively as a contrast term to ‘demonstration’: whereas mathematical reasoning as theorized by modern formal logic, he writes, is a matter of deducing theorems from axioms in accordance with stipulated rules of transformation, argumentation aims at gaining the adherence of minds (Perelman 1969, pp. 1–2). Toulmin (1958) contrasted his “jurisprudential model” of argument, according to which (...) the validity of an argument is a matter of its following proper procedure, with a “geometrical model” according to which validity is a matter of its having a proper shape comparable to the shape of a triangle (Toulmin 1958, p. 95). Johnson (2000, pp. 231–232) argues explicitly that a mathematical proof is not an argument.In the collection under review, Andrew Aberdein and Ian Dove have assembled a number of recent. (shrink)

In this article, we report a study in which 109 research-active mathematicians were asked to judge the validity of a purported proof in undergraduate calculus. Significant results from our study were as follows: (a) there was substantial disagreement among mathematicians regarding whether the argument was a valid proof, (b) applied mathematicians were more likely than pure mathematicians to judge the argument valid, (c) participants who judged the argument invalid were more confident in their judgments than those who judged it valid, (...) and (d) participants who judged the argument valid usually did not change their judgment when presented with a reason raised by other mathematicians for why the proof should be judged invalid. These findings suggest that, contrary to some claims in the literature, there is not a single standard of validity among contemporary mathematicians. (shrink)

Complete inferential rigour is achieved by breaking down arguments into steps that are as small as possible: inferential ‘atoms’. For example, a mathematical or philosophical argument may be made completely inferentially rigorous by decomposing its inferential steps into the type of step found in a natural deduction system. It is commonly thought that atomization, paradigmatically in mathematics but also more generally, is pro tanto epistemically valuable. The paper considers some plausible candidates for the epistemic value arising from atomization and finds (...) that none of them fits the bill. In particular, atomized arguments do not ground the correctness of their unatomized counterparts; they are typically not credence-preserving; and they need not reveal the source of inferential disagreement. The moral this suggests is that complete rigour is not even a defeasible epistemic ideal. (shrink)

This paper assumes the success of arguments against the view that informal mathematical proofs secure rational conviction in virtue of their relations with corresponding formal derivations. This assumption entails a need for an alternative account of the logic of informal mathematical proofs. Following examination of case studies by Manders, De Toffoli and Giardino, Leitgeb, Feferman and others, this paper proposes a framework for analysing those informal proofs that appeal to the perception or modification of diagrams or to the inspection or (...) imaginative manipulation of mental models of mathematical phenomena. Proofs relying on diagrams can be rigorous if it is easy to draw a diagram that shares or otherwise indicates the structure of the mathematical object, the information thus displayed is not metrical and it is possible to put the inferences into systematic mathematical relation with other mathematical inferential practices. Proofs that appeal to mental models can be rigorous if the mental models can be externalised as diagrammatic practice that satisfies these three conditions. (shrink)