Online research in philosophy

From ancient times to the present, the discovery and presentation of new proofs of previously established theorems has been a salient feature of mathematical practice. Why? What purposes are served by such endeavors? And how do mathematicians judge whether two proofs of the same theorem are essentially different? Consideration of such questions illuminates the roles that proofs play in the validation and communication of mathematical knowledge and raises issues that have yet to be resolved by mathematical logicians. The Appendix, in which several proofs of the Fundamental Theorem of Arithmetic are compared, provides a miniature case study.

Philosophy of Mathematics is clear and engaging, and student friendly The book discusses the great philosophers and the importance of mathematics to their thought. Among topics discussed in the book are the mathematical image, platonism, picture-proofs, applied mathematics, Hilbert and Godel, knots and notation definitions, picture-proofs and Wittgenstein, computation, proof and conjecture.

This paper concerns the role of intuitions in mathematics, where intuitions are meant in the Kantian sense, i.e. the “seeing” of mathematical ideas by means of pictures, diagrams, thought experiments, etc.. The main problem discussed here is whether Platonistic argumentation, according to which some pictures can be considered as proofs (or parts of proofs) of some mathematical facts, is convincing and consistent. As a starting point, I discuss James Robert Brown’s recent book Philosophy of Mathematics, in particular, his primarily examples and analogies. I then consider some alternatives and counterarguments, namely John Norton’s opposite view, that intuitions are just pictorially represented logical arguments and are superfluous; and the Kantian transcendental theory of construction in imagination, as it is developed in the works of Marcus Giaquinto and Michael Friedman. Although I support the claim that some intuitions are essential in mathematical justification, I argue that a Platonistic approach to intuitions is partial and one should go further than a Platonist in explaining how some intuitions can deliver new mathematical knowledge.

Most philosophers still tend to believe that mathematics is basically about producing formal proofs. A consequence of this view is that some aspects of mathematical practice are entirely lost from view. My contention is that it is precisely in those aspects that similarities can be found between practices in the exact sciences and in mathematics. Hence, if we are looking for a (more) unified treatment of science and mathematics it is necessary to incorporate these elements into our view of what mathematics is about. As a helpful tool I introduce the notion of a mathematical argument as a more liberalized version of the notion of mathematical proof.

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].

1. Introduction : the mathematical image -- 2. Platonism -- 3. Picture-proofs and Platonism -- 4. What is applied mathematics? -- 5. Hilbert and Gödel -- 6. Knots and notation -- 7. What is a definition? -- 8. Constructive approaches -- 9. Proofs, pictures and procedures in Wittgenstein -- 10. Computation, proof and conjecture -- 11. How to refute the continuum hypothesis -- 12. Calling the bluff.

This paper is concerned with real proofs as opposed to formal proofs, and specifically with the ultimate reason of real proofs (`Why Proof?') and with the notion of real proof (`What is a Proof?').

In a series of papers, Don Fallis points out that although mathematicians are generally unwilling to accept merely probabilistic proofs, they do accept proofs that are incomplete, long and complicated, or partly carried out by computers. He argues that there are no epistemic grounds on which probabilistic proofs can be rejected while these other proofs are accepted. I defend the practice by presenting a property I call ‘transferability’, which probabilistic proofs lack and acceptable proofs have. I also consider what this says about the similarities between mathematics and, on the one hand natural sciences, and on the other hand philosophy.

The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers cannot be a priori. It also created a lingering impression to the effect that such proofs depend heavily for their soundness on large amounts of computation-intensive custom-built software. Contra Tymoczko, we argue that the justification provided by certain computerized mathematical proofs is not fundamentally different from that provided by surveyable proofs, and can be sensibly regarded as a priori. We also show that the aforementioned impression is mistaken because it fails to distinguish between proof search (the context of discovery) and proof checking (the context of justification). By using mechanized proof assistants capable of producing certificates that can be independently checked, it is possible to carry out complex proofs without the need to trust arbitrary custom-written code. We only need to trust one fixed, small, and simple piece of software: the proof checker. This is not only possible in principle, but is in fact becoming a viable methodology for performing complicated mathematical reasoning. This is evinced by a new proof of the four-color theorem that appeared in 2005, and which was developed and checked in its entirety by a mechanical proof system.

In Part III of his Remarks on the Foundations of Mathematics Wittgenstein deals with what he calls the surveyability of proofs. By this he means that mathematical proofs can be reproduced with certainty and in the manner in which we reproduce pictures. There are remarkable similarities between Wittgenstein's view of proofs and Hilbert's, but Wittgenstein, unlike Hilbert, uses his view mainly in critical intent. He tries to undermine foundational systems in mathematics, like logicist or set theoretic ones, by stressing the unsurveyability of the proof-patterns occurring in them. Wittgenstein presents two main arguments against foundational endeavours of this sort. First, he shows that there are problems with the criteria of identity for the unsurveyable proof-patterns, and second, he points out that by making these patterns surveyable, we rely on concepts and procedures which go beyond the foundational frameworks. When we take these concepts and procedures seriously, mathematics does not appear as a uniform system, but as a mixture of different techniques.