Non-paradoxical logical consequence and the problem of solving ML-equations

In this paper we consider a $\#P$-complete problem of calculating all performing substitutions for a Boolean equation $F(x_1, x_2,\ldots , x_n)=1$. We propose a new way to solve this problem by its reduction to a problem of determination of a set $U$, such that $U = F(X_1, X_2,\ldots, X_n)$, where $X_1, X_2,\ldots, X_n$ is a set algebra formula which is isomorphic to $F(x_1, x_2,\ldots , x_n)$ and $X_n$ are known sets. Variables $x_1, x_2,\ldots, x_n$ of a logical equation are characteristic functions for the sets $X_1, X_2,\ldots, X_n $ from the second equality which is referred to as ML-equation. (In Russian).