On Semantic Gamification

In S. Ghosh & S. Prasad (eds.), Logic and its Applications, Lecture Notes in Computer Science 10119. Springer (2017)
Download Edit this record How to cite View on PhilPapers
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 Ɓukasiewicz) and some non-algebraizable (like intuitionistic and van Fraassen supervaluation logic).
Keywords
No keywords specified (fix it)
Categories
(categorize this paper)
PhilPapers/Archive ID
QUIOSG
Upload history
Archival date: 2019-11-03
View other versions
Added to PP index
2019-11-03

Total views
34 ( #60,048 of 2,456,062 )

Recent downloads (6 months)
6 ( #56,666 of 2,456,062 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.