"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.

This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits any noncommercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if you modified the licensed material. You do not have permission under this license to share adapted material derived from this chapter or parts of it.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.