Let A⊆N={0,1,2,...} and β be an n-ary Boolean function. We call A a β-implicatively selector (β-IS) set if there exists an n-ary selector general recursive function f such that (∀x₁,...,x_n)(β(χ(x₁),...,χ(x_n))=1⟹f(x₁,...,x_n)∈A), where χ is the characteristic function of A. Let F^(m), m≥1, be the family of all d _m+1 ^* -IS sets, where d_{m + 1}^* = \mathop &amp; _{1 \leqslant i < j \leqslant m + 1} (x_i Úx_j )d_{m + 1}^* = \mathop \& \limits_{1 \leqslant i< j \leqslant m + 1} (x_i \vee x_j ) , F⁽⁰⁾=N, and F^(∞) is the class of all subsets in N. The basic result of the article says that the family of all β-IS sets coincides with one of F^(m), m≥0, or F^(∞), and, moreover, the inclusions F⁽⁰⁾⊂F⁽¹⁾⊂...⊂F^(∞) hold.