Thus, logical laws governing reasoning with such formulas acquire game-theoretic content. For instance, the negation of the statement that one player, A, has a winning strategy is provably equivalent to saying that the other player, E, has a winning strategy, at least in those cases where A wins if and only if E does not: