Mathematical Reasoning: Conceptual Proof and Logic Conclusion
Table of contents
Share
QR
Metrics
Mathematical Reasoning: Conceptual Proof and Logic Conclusion
Annotation
PII
S1811-833X0000617-8-1
Publication type
Article
Status
Published
Pages
74-86
Abstract
The article is devoted to the comparison of two types of proofs in mathematical practice, the methodological differences of which go back to the difference in the understanding of the nature of mathematics by Descartes and Leibniz. In modern philosophy of mathematics, we talk about conceptual and formal proofs in connection with the so-called Hilbert Thesis, according to which every proof can be transformed into a logical conclusion in a suitable formal system. The analysis of the arguments of the proponents and opponents of the Thesis, "conceptualists" and "formalists", is presented respectively by the two main antagonists - Y. Rav and J. Azzouni. The focus is on the possibility of reproducing the proof of "interesting" mathematical theorems in the form of a strict logical conclusion, in principle feasible by a mechanical procedure. The argument of conceptualists is based on pointing out the importance of other aspects of the proof besides the logical conclusion, namely, in introducing new concepts, methods, and establishing connections between different sections of meaningful mathematics, which is often illustrated by the case of proving Fermat's Last Theorem (Y. Rav). Formalists say that a conceptual proof "points" to the formal logical structure of the proof (J. Azzouni). The article shows that the disagreement is based on the assumption of asymmetry of mutual translation of syntactic and semantic structures of the language, as a result of which the formal proof loses important semantic factors of proof. In favor of a formal proof, the program of univalent foundations of mathematics In. Vojevodski, according to which the future of mathematical proofs is associated with the availability of computer verification programs. In favor of conceptual proofs, it is stated (A. Pelc) that the number of steps in the supposed formal logical conclusion when proving an "interesting" theorem exceeds the cognitive abilities of a person. The latter circumstance leads the controversy beyond the actual topic of mathematical proof into the epistemological sphere of discussions of "mentalists" and "mechanists" on the question of the supposed superiority of human intelligence over the machine, initiated by R. Penrose in his interpretation of the Second Theorem of Goedel, among whose supporters, as it turned out, was Goedel himself.
Keywords
mathematical practice, proof, logical conclusion, theorem, formalism, Hilbert's thesis
Date of publication
01.12.2020
Number of purchasers
11
Views
413
Readers community rating
0.0 (0 votes)
Cite Download pdf

References



Additional sources and materials

  1. Azzouni, J. “The Derivation-Indicator View of Mathematical Practice”, Philosophia Mathemaica, 2004, vol. 12, no. 3, 2004, pp. 81‒105.
  2. Bourbaki, N. “Arkhitektura matematiki” [Architecture of Mathematics], in: Ocherki po istorii matematiki [History of Mathematics: An Outline]. Moscow: Izdatelstvo inostrannoi literatury, 1963, pp. 245‒259 (In Russian)
  3. Hacking, I. Pochemu voobshche sucshchestvuet filosofija matematiki [Why Is There Philosophy of Mathematics at all]. Moscow: Kanon+, 2020, 399 pp. (In Russian)
  4. Hilbert, D. Ocnovaniya geometrii [Foundation of Geometry]. Moscow: OGIZ, 1948, 492 pp. (In Russian)
  5. Horgan, J. “The Death of Proof”, Scientific American, 1993, vol. 269, no. 4, pp. 92‒103.
  6. Kreisel, G. “Mathematical Logic: Tool and Object Lesson for Science”, Synthese, 1985, vol. 62, pp. 139‒151.
  7. Kripke, S. “The Church-Turing‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem”, in: B.J. Copeland, C. Posy & O. Shagrir (eds.). Computability: Turing, Gödel, Church, and Beyond. Chicago: MIT Press, 2013, pp. 77‒104.
  8. Lakatos, I. Dokazatelstva i oproverzheniya [Proofs and Refutations]. Moscow: Nauka, 1967, 152 pp.
  9. Pelc, A. “Why Do We Believe Theorems”, Philosophia Mathematica, 2009, vol. 17, no. 1, pp. 84‒94.
  10. Penrose, R. Teni razuma [Shadows of the Mind]. Moscow: Instititut komputernykh isslidovanii, 2003, 367 pp. (In Russian)
  11. Rav, Y. “A Critique of a Formalist-Mechanist Version of the Justification of Arguments in Mathematicians’ Proof Practices”, Philosophia Mathematica, 2007, vol. 15, pp. 291‒320.
  12. Rav, Y. “Why Do We Prove Theorems?”, Philosophia Mathematica, 1999, vol. 7, no. 3, pp. 5‒41.
  13. Tselishchev, V.V. Algoritmizatsiya myshleniya: gedelevskii argument [Algoritmization of Reasoning: Goedelian Argument]. Novosibirsk: Parallel, 2005, 303 pp. (In Russian)

Comments

No posts found

Write a review
Translate