 In Sevenster (2014), patterns of quantifier dependence and independence in quantifier prefixes of slash-logical formulas are systematically studied in order to determine which quantifier prefixes allow slash logic to gain the expressive power of \(\mathbf{ESO}\). Sevenster identifies two such patterns – the signaling pattern and the Henkin pattern – and proves that they are able to express \(\mathbf{NP}\)-hard decision problems. He further shows that these two are the only patterns allowing slash logic to exceed the expressive power of \(\mathbf{FO}\) insofar as attention is confined to formulas in prenex form. An example of the signaling pattern would be \( (\forall u)(\exists v)(\exists w/u) \) and of the Henkin pattern \( (\forall x)(\exists u)(\forall y)(\exists v/x,u)  \).[94] 