 From the viewpoint of GTS, the connective \(\neg\) behaves in an unusual way. For all connectives of \(\mathbf{IFL}\), there is a game rule (which can be seen as specifying the meaning of the connective). For contradictory negation there is no game rule, and its semantics is not explained in terms of plays of semantic games. A formula \(\neg \phi\) serves to say, globally, something about an entire game \(G(\phi , M, g)\). If \(\phi\) is a sentence, to say that \(\neg \phi\) is true in \(M\) is to say that player 2 does not have a winning strategy in game \(G(\phi , M)\). If, again, there is indeed a winning strategy for player 2 in \(G(\phi , M)\), by stipulation \(\neg \phi\) is false in  \(M\).[31]