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

We consider the # 𝑃-complete problem of computing all the permutations that fulfill the logical equation (𝑥1, 𝑥2, ...,) = 1. A new way of solving this problem is proposed, by reducing to the problem of computing a set 𝑈 such that = (𝑋1, 𝑋2, .. .,). Here (𝑋1, 𝑋2, ...,) is the formula of the algebra of sets isomorphic to (𝑥1, 𝑥2, ...,), and are known sets. Variables in the logical equation are characteristic functions for sets from the second equation, which is called the ML-equation