Proofs and Refutations, Non-classically and Game Theoretically
摘要
Lakatos’s seminal work Proofs and Refutations depends heavily on counter-examples and refutations. In this work, I argue that the said dependancy goes further than anticipated, rendering Proofs and Refutations a working example of paraconsistent reasoning in mathematical methodology. I also maintain that Proofs and Refutations is an example of paraconsistent reasoning with strategies, making it an example of game theoretical and strategic reasoning in mathematical methodology.