title: What is a proof?
abstract: To those brought up in a logic-based tradition there seems to be a simple and clear definition of proof. But this is largely a twentieth century invention; many earlier proofs had a different nature. We will look particularly at the faulty proof of Euler's Theorem and Lakatos' rational reconstruction of the history of this proof. We will ask: how is it possible for the errors in a faulty proof to remain undetected for several years-even when counter-examples to it are known? How is it possible to have a proof about concepts that are only partially defined? And can we give a logic-based account of such phenomena? We introduce the concept of schematic proofs and argue that they offer a possible cognitive model for the human construction of proofs in mathematics. In particular, we show how they can account for persistent errors in proofs.
authors.affiliation: University of Edinburgh, School of Informatics Appleton Tower, Crichton Street, Edinburgh EH8 9LE, UK. a.bundy@ed.ac.uk
authors.forename: Alan
authors.initials: A
authors.lastname: Bundy
authors.forename: Mateja
authors.initials: M
authors.lastname: Jamnik
authors.forename: Andrew
authors.initials: A
authors.lastname: Fugard
mesh_terms: D000465:Algorithms; D003469:Culture; D008432:Mathematical Computing; D008962:Models, Theoretical; D009716:Numerical Analysis, Computer-Assisted; D012984:Software; D012986:Software Validation