Game-theoretic semantics for non-distributive logics
AbstractWe introduce game-theoretic semantics for systems without the conveniences of either a De Morgan negation, or of distribution of conjunction over disjunction and conversely. Much of game playing rests on challenges issued by one player to the other to satisfy, or refute, a sentence, while forcing him/her to move to some other place in the game’s chessboard-like configuration. Correctness of the game-theoretic semantics is proven for both a training game, corresponding to Positive Lattice Logic and for more advanced games for the logics of lattices with weak negation and modal operators (Modal Lattice Logic).
2014 ◽
pp. 320-320
2018 ◽
Vol 19
(3)
◽
pp. 1-38
◽
2008 ◽
Vol 73
(4)
◽
pp. 1433-1457
◽
Keyword(s):
2008 ◽
Vol 102
(3)
◽
pp. 319-332
◽
Keyword(s):
2010 ◽
Vol 3
(3)
◽
pp. 485-519
◽
Keyword(s):
2015 ◽
Vol 1
(3)
◽
pp. 485-508
◽
Keyword(s):
1996 ◽
Vol 4
◽
pp. 477-507
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):