Abstract

We argue that there are mutually beneficial connections to be made between ideas in argumentation theory and the philosophy of mathematics, and that these connections can be suggested via the process of producing computational models of theories in these domains. We discuss Lakatos’s work (Proofs and Refutations, 1976) in which he championed the informal nature of mathematics, and our computational representation of his theory. In particular, we outline our representation of Cauchy’s proof of Euler’s conjecture, in which we use work by Haggith on argumentation structures, and identify connections between these structures and Lakatos’s methods.