Computing with mathematical arguments

Jesse Alama, Reinhard Kahle

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Thanks to developments in the last few decades in mathematical logic and computer science, it has now become possible to formalize non-trivial mathematical proofs in essentially complete detail. we discuss the philosophical problems and prospects for such formalization enterprises. We show how some perennial philosophical topics and problems in epistemology, philosophy of science, and philosophy of mathematics can be seen in the practice of formalizing mathematical proofs.

Original languageEnglish
Title of host publicationNew Challenges to Philosophy of Science
EditorsH. Andersen, D. Dieks, W. Gonzalez, T. Uebel, G. Wheeler
Place of PublicationDordrecht
PublisherSpringer Netherlands
Pages9-22
Number of pages14
ISBN (Electronic)978-94-007-5845-2
ISBN (Print)978-94-007-5844-5
DOIs
Publication statusPublished - 1 Jan 2013

    Fingerprint

Keywords

  • Epistemic justification
  • Formal proof
  • Inferentialism
  • Mathematics
  • Philosophy of mathematics

Cite this

Alama, J., & Kahle, R. (2013). Computing with mathematical arguments. In H. Andersen, D. Dieks, W. Gonzalez, T. Uebel, & G. Wheeler (Eds.), New Challenges to Philosophy of Science (pp. 9-22). Dordrecht: Springer Netherlands. https://doi.org/10.1007/978-94-007-5845-2_2