Verification of the logical sequence in nonclassical multivalued logic

The article discusses the use of the proposed nonclassical multivalued logics $L_{S_{2}}$. The interpretation of the formulae of this logic is constructed using the algebraic system. $\Sigma(\Omega)$ is a set support, a collection of subsets of the universe $\Omega$. This collection can be created using the operations $\{~\cdot,~+,~\prime~\}$ from the model of sets ${\tilde \aleph _n} = \left\langle {{\aleph _1},{\aleph _2},\ldots,{\aleph _n}} \right\rangle$. This work illustrates the use of multiple-valued logic $L_{S_{2}}$ to solve the problem of the verification of reasoning. It is shown that if the task of verification can be formulated in terms of a correspondence between sets, then the verification of a logical sequence can be made using the extremal properties of the Galois-correspondence. It is necessary to use semantic values of formulas of $L_{S_{2}}$. The semantic value of a formula is a single or multi-element family of constituency sets. The proposed approach allows one to significantly reduce the computational complexity of verification of reasoning in comparison with the algorithms used for the logic of predicates of first order. The paper illustrates the possibility of an algebraic approach laid down by Aristotle, Gergonne, Boole, and Poretsky.