## 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 language | English |
---|---|

Title of host publication | The Argument of Mathematics |

Publisher | Springer Netherlands |

Pages | 147-170 |

Number of pages | 24 |

ISBN (Electronic) | 978-940076534-4 |

ISBN (Print) | 978-940076533-7 |

DOIs | |

Publication status | Published - 1 Jan 2013 |

## Keywords

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