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)

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)

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)

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)

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)

The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and argumentation schemes, in particular, (...) as a methodology for the study of mathematical practice is thereby demonstrated. Argumentation schemes represent an almost untapped resource for mathematics education. Notably, they provide a consistent treatment of rigorous and non-rigorous argumentation, thereby working to exhibit the continuity of reasoning in mathematics with reasoning in other areas. Moreover, since argumentation schemes are a comparatively mature methodology, there is a substantial body of existing work to draw upon, including some increasingly sophisticated software tools. Such tools have significant potential for the analysis and evaluation of mathematical argumentation. The first four sections of the paper address the relationships of evidence to proof, proof to derivation, argument to proof, and argument to evidence, respectively. The final section directly addresses some of the educational implications of an argumentation scheme account of mathematical reasoning. (shrink)