An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...