 Syntactically slash logic uses quantifiers like \((\exists x/y)\) instead of quantifiers such as \((\exists x/\forall y)\). Semantically slash logic is otherwise like \(\mathbf{IFL}\) except that its game-theoretical semantics is based on the idea that a player’s strategy functions may utilize as their arguments any preceding moves made in the current play, save for those whose use is, by the slash notation, explicitly indicated as forbidden (cf. Sect. 3). That is, also a player’s own earlier moves may appear as arguments of a strategy function. This can make a difference in the presence of imperfect information. For example, consider evaluating the slash-logic sentence \((\forall x)(\exists y)(\exists z/x) x = z\) containing the vacuous quantifier \(\exists y\). This sentence is true on a two-element domain, since player 2 can copy as the value of \(y\) the value that player 1 has chosen for \(x\), and then select the value of \(z\) using a strategy function whose only argument is the value of \(y\). (For this phenomenon of ‘signaling,’ see Hodges 1997a, Sandu 2001, Janssen &amp; Dechesne 2006, Barbero 2013.) By contrast, the IF sentence \((\forall x)(\exists y)(\exists z/\forall x) x = z\) fails to be true on such a domain, since there a strategy function for \((\exists z/\forall x)\) must be a constant, and no such strategy function can guarantee a win for player 2 against both possible values that player 1 can choose for \(x\). As mentioned in Subsection 4.4, Hodges (1997a,b) showed that slash logic admits of an alternative, compositional semantics. This requires evaluating formulas relative to sets of variable assignments, instead of single assignments as in connection with \(\mathbf{FO}\).