Poster

Tuesday, March 29, 20162:00 pmComputational Logic SeminarGraduate Center, rm. 4422

Towards Paraconsistent Game Theory

Can Başkent

Department of Computer Science, University of Bath, England

Can Başkent

In this programmatic talk, I will talk about three major examples of paraconsistency and paradoxes in games. Paraconsistent logic is a family of non-classical logics in which contradictions do not entail everything. In this talk, first, I will discuss game theoretical semantics for paraconsistent logic and observe how semantic games change in different, especially in paraconsistent logics. Then, I will consider a self-referential paradox of epistemic game theory, called Brandenburger-Keisler Paradox, and present a model for it. Following, I will shift my attention non-self-referential paradoxes and suggest a non-self-referential paradox in games. These three major cases, I will argue, will be a call for the necessity of the use of non-classical logics in game theoretical reasoning.

Ph.D. in Computer Science under Rohit Parikh in 2012, The Graduate Center, The City University of New York. Dissertation Title “Some Non-Classical Methods in Epistemic Logic and Games.” Currently a Post-Doctoral Researcher, Department of Computer Science, University of Bath, England, a Research associate at a project on game theory and logic.