Game theoretical semantics for some non-classical logics
Baskent, Can 
ORCID: https://orcid.org/0000-0001-6229-8699
(2016)
Game theoretical semantics for some non-classical logics.
Journal of Applied Non-Classical Logics, 26
(3)
.
pp. 208-239.
ISSN 1166-3081
[Article]
(doi:10.1080/11663081.2016.1225488)
|
PDF
- Final accepted version (with author's formatting)
Download (402kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science > Foundations of Computing group |
| Item ID: | 28852 |
| Notes on copyright: | This is an Accepted Manuscript of an article published by Taylor & Francis in Journal of Applied Non-Classical Logics on 02/09/2016, available online: http://www.tandfonline.com/10.1080/11663081.2016.1225488 |
| Useful Links: | |
| Depositing User: | Can Baskent |
| Date Deposited: | 24 Jan 2020 10:06 |
| Last Modified: | 09 Jun 2021 18:46 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/28852 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)