Abstract

This paper explores some of the benefits informal logic may have for the analysis of mathematical inference. It shows how Stephen Toulmin’s pioneering treatment of defeasible argumentation may be extended to cover the more complex structure of mathematical proof. Several common proof techniques are represented, including induction, proof by cases, and proof by contradiction. Affinities between the resulting system and Imre Lakatos’s discussion of mathematical proof are then explored.