Bridging the gap between argumentation theory and the philosophy of mathematics (Q2271079)

The authors argue in the paper 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. They start by discussing \textit{I. Lakatos}' [Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, Cambridge (1976; Zbl 0334.00022)] and then their computational representation of his theory is presented. Further it is shown how Cauchy's proof of Euler's conjecture can be represented. Aspects of Lakatos' method of lemma-incorporation are discussed. Some connections between Haggith's argumentation structures and Lakatos' methods are outlined.