Abstract
The purpose of this essay is to study the extent in which the semantics for different logical systems can be represented game theoretically. I will begin by considering different definitions of what it means to gamify a semantics, and show completeness and limitative results. In particular, I will argue that under a proper definition of gamification, all finitely algebraizable logics can be gamified, as well as some infinitely algebraizable ones (like Lukasiewicz) and some non-algebraizable (like intuitionistic and van Fraassen supervaluation logic).
Cite
CITATION STYLE
Quintana, I. O. (2017). On semantic gamification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10119 LNCS, pp. 183–197). Springer Verlag. https://doi.org/10.1007/978-3-662-54069-5_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
