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 sketches an account of the standard of acceptable proof in mathematics—rigour—arguing that the key requirement of rigour in mathematics is that nontrivial inferences be provable in greater detail. This account is contrasted with a recent perspective put forward by De Toffoli and Giardino, who base their claims on a case study of an argument from knot theory. I argue that De Toffoli and Giardino’s conclusions are not supported by the case study they present, which instead is a very (...) good illustration of the kind of view of proof defended here. (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.

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)

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.

(No abstract is available for this citation).

It is argued in this study that (i) progress in the philosophy of mathematical practice requires a general positive account of informal proof; (ii) the best candidate is to think of informal proofs as arguments that depend on their matter as well as their logical form; (iii) articulating the dependency of informal inferences on their content requires a redefinition of logic as the general study of inferential actions; (iv) it is a decisive advantage of this conception of logic that it (...) accommodates the many mathematical proofs that include actions on objects other than propositions; (v) this conception of logic permits the articulation of project-sized tasks for the philosophy of mathematical practice, thereby supplying a partial characterisation of normal research in the field. (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)

This paper presents examples of infinite diagrams (as well as infinite limits of finite 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.

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)

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.

Rigorous proof is supposed to guarantee that the premises invoked imply the conclusion reached, and the problem of rigor may be described as that of bringing together the perspectives of formal logic and mathematical practice on how this is to be achieved. This problem has recently raised a lot of discussion among philosophers of mathematics. We survey some possible solutions and argue that failure to understand its terms properly has led to misunderstandings in the literature.

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)