 Barbero (2021) and Barbero et al. (2021) take up the task of investigating fragments of the general syntax of slash logic (not all of whose formulas are in prenex form). Thereby these authors wish to study systematically those expressive resources of slash logic that allow it to exceed the expressive power of \(\mathbf{FO}\) and that do not simply derive from its capacity to mimick Henkin quantifiers. While many of the features studied in these two papers depend on the Eigenart of slash logic, the phenomenon of signaling by disjunction occurs in IF logic, as well. In Section 3.3, it was seen that the IF-logical sentence \((\forall x)(\exists y/\forall x) x = y\) is non-determined in any model whose domain has exactly two elements. The slash-logical sentence \((\forall x)(\exists y/ x) x = y\) is likewise non-determined in such a model. Now, consider the result of replacing in the latter sentence the expression \((\exists y/ x) x = y\) by the disjunction \(((\exists y/x) x = y \vee (\exists y/ x) x = y))\), with a token of the initial expression in both disjuncts:  \[ (\forall x)((\exists y/ x) x = y \vee (\exists y/x) x = y). \]  The sentence that has been thus obtained is actually true in a model whose domain consists of the objects \(a\) and \(b\). Let \(f\), \(g\), and \(h\) be respectively the strategy functions of player 2 for the unique token of the disjunction symbol, the left token of the existential quantifier, and the right token of the existential quantifier – defined as follows. First, \(f\) selects the left disjunct if player 1 has chosen \(a\) as a value of \(x\), selecting the right disjunct otherwise. Further, \(g\) and \(h\) are constants (zero-place functions): \(g= a\) and \(h= b\). The set \(\{f, g, h\}\) is clearly a winning strategy for player 2. Either of the tokens of the existential quantifier occur in a specific disjunct. Using the strategy function \(f\) to arrive at such a disjunct makes sure that the disjunct arrived at reveals the choice that player 1 has made to interpret \(\forall x\). The constants \(g\) and \(h\) are selected so as to render this information explicit. Thus, the resulting values of \(x\) and \(y\) indeed satisfy the formula \(x= y\). By the same reasoning it is seen that the sentence \((\forall x)((\exists y/ \forall x) x = y \vee (\exists y/\forall x) x = y)\) of \(\mathbf{IFL}\) is true in the model considered.