Checking proofs

Jesse Alama, Reinhard Kahle

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

Contemporary argumentation theory tends to steer away from traditional formal logic. In the case of argumentation theory applied to mathematics, though, it is proper for argumentation theory to revisit formal logic owing to the in-principle formalizability of mathematical arguments. Completely formal proofs of substantial mathematical arguments suffer from well-known problems. But practical formalizations of substantial mathematical results are now available, thanks to the help provided by modern automated reasoning systems. In-principle formalizability has become in-practice formalizability. Such efforts are a resource for argumentation theory applied to mathematics because topics that might be thought to be essentially informal reappear in the computer-assisted, formal setting, prompting a fresh appraisal.

Original languageEnglish
Title of host publicationThe Argument of Mathematics
PublisherSpringer Netherlands
Pages147-170
Number of pages24
ISBN (Electronic)978-940076534-4
ISBN (Print)978-940076533-7
DOIs
Publication statusPublished - 1 Jan 2013

Keywords

  • Formal logic
  • Mathematical practice
  • Mathematical proof
  • Natural deduction
  • Proof analysis
  • Proof checking
  • Proof reconstruction

Fingerprint Dive into the research topics of 'Checking proofs'. Together they form a unique fingerprint.

Cite this