Logic and Coherence in The Light of Competitive Games

The class of non-strictly competitive games is commonplace in game theory, but it has not been applied to logic before. In this paper, it is argued that one way of motivating non-coherence in logic is by means of the class of non-strictly competitive games, applied to the framework of semantic games. It is shown that just as partial logics are generated by games of imperfect information, formulas with over-defined truth-values arise either by having non-strictly competitive semantic games or by adding a weak negation to partial logic. Finally, a couple of implications to games and logic are discussed.