Game theoretical semantics for some non-classical logics

Content Provider	Scilit
Author	Başkent, Can
Copyright Year	2016
Description	Paraconsistent logics are the formal systems in which absurdities do not trivialise the logic. In this paper, we give Hintikka-style game theoretical semantics for a variety of paraconsistent and non-classical logics. For this purpose, we consider Priest's Logic of Paradox, Dunn's First-Degree Entailment, Routleys' Relevant Logics, McCall's Connexive Logic and Belnap's four-valued logic. We also present a game theoretical characterisation of a translation between Logic of Paradox/Kleene's K3 and S5. We underline how non-classical logics require different verification games and prove the correctness theorems of their respective game theoretical semantics. This allows us to observe that paraconsistent logics break the classical bidirectional connection between winning strategies and truth values.
Related Links	https://core.ac.uk/download/pdf/80689913.pdf https://eprints.mdx.ac.uk/28852/1/gamsem.pdf
Ending Page	239
Page Count	32
Starting Page	208
ISSN	11663081
e-ISSN	19585780
DOI	10.1080/11663081.2016.1225488
Journal	Journal of Applied Non-classical Logics
Issue Number	3
Volume Number	26
Language	English
Publisher	Informa UK Limited
Publisher Date	2016-07-02
Access Restriction	Open
Subject Keyword	Journal: Journal of Applied Non-classical Logics History Literary Studies Game Theoretical Semantics Logic of Paradox First-degree Entailment Relevant Logic Connexive Logic Belnap's Four-valued Logic B4 Modal Logic S5
Content Type	Text
Resource Type	Article
Subject	Philosophy Logic