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)

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)

The issue of what constitutes a valid logical inference is a difficult question. At a minimum, we believe a permissible step in a proof must provide the reader with rational grounds to believe that the new step is a logically necessary consequence of previous assertions. However, this begs the question of what constitutes these rational grounds. Formalist accounts typically describe valid rules of inferences as those that can be found by applying one of the explicit rules of inference in the (...) formal system in which the proof is couched. However, philosophers of mathematics find such a description unhelpful because many inferences in the proofs that mathematicians actually produce cannot be expressed in a formal language, at least not without seriously distorting the semantic content of the inference (e.g., Larvor, 2012). In this chapter, we investigate mathematicians’ perceptions of a particular kind of inference in a particular setting. Specifically, we shed light on what types of graphical inferences mathematicians find permissible in a real analysis proof. Following Larvor (in press), we examine mathematicians’ reactions to metrical graphical inferences (i.e., inferences whose validity depends on the accuracy of the graph that was drawn and whose validity can be changed by minor deformations) and nonmetrical graphical inferences (i.e., inferences whose validity does not depend on a the accuracy of the graph and whose validity is not vulnerable to local deformations). The goal of this chapter is threefold. First, we demonstrate that most mathematicians reject metrical graphical inferences as impermissible in a real analysis proof. Second, we show that many mathematicians regard nonmetrical graphical inferences as permissible in a real analysis proofs. Third, we illustrate how mathematicians collectively disagree on the permissibility of nonmetrical inferences. (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)

Traditional models of mathematical proof describe proofs as sequences of assertion where each assertion is a claim about mathematical objects. However, Tanswell observed that in practice, many proofs do not follow these models. Proofs often contain imperatives, and other instructions for the reader to perform mathematical actions. The purpose of this paper is to examine the role of instructions in proofs by systematically analyzing how instructions are used in Kunen’s Set theory: An introduction to independence proofs, a widely used graduate (...) text in set theory. I use Kunen’s text to describe how instructions and constructions in proof work in mathematical practice and explore epistemic consequences of how proofs are read and understood. (shrink)