Verification of the logical sequence in nonclassical multivalued logic. (Russian. English summary) Zbl 1388.03028

Summary: 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,+,'\}\) from the model of sets \(\tilde{\aleph}_n=\langle\aleph_1,\aleph_2,\ldots,\aleph_n\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.


03B50 Many-valued logic
03G25 Other algebras related to logic
03B70 Logic in computer science
06A15 Galois correspondences, closure operators (in relation to ordered sets)
Full Text: DOI


[1] [1] Smetanin Yu. M., “Algorithm for solving polisillogizm in the orthogonal basis by calculating the constituent sets”, Vestn. Udmurt. Univ. Mat. Mekh. Komp’yut. Nauki, 2010, no. 4, 172-185
[2] [2] Smetanin Iu., “Syllogistical system on the basis of the propositional multivalued logic”, 2015 International Conference «Stability and Control Processes» in Memory of V. I. Zubov (SCP), IEEE, 2015, 596-599
[3] [3] Smetanin Iu. M., “Multivalued propositional logic with unparadoxical logical consequence”, Ninth Smirnov Readings on Logic, Proceedings of the International Scientific Conference, Sovremennye tetradi, M., 2015, 36-38 (in Russian)
[4] [4] Smetanin Yu. M., “Non-paradoxical logical consequence and the problem of solving ML-equations”, Programmnye Sistemy: Teoriya i Prilozheniya, 7:1(28) (2016), 99-115 (in Russian) · Zbl 1483.68457
[5] [5] Smetanin Yu. M., “Verification of logical consequence, using the calculus of constituent sets and correspondences of Galois”, Programmnye Sistemy: Teoriya i Prilozheniya, 8:2(33) (2017), 69-93 (in Russian)
[6] [6] Smetanin Yu. M., Smetanina L. P., “Logical-semantic model for solving problems of pattern recognition and calculation of risks”, Bulletin of Udmurt University. Series Biology. Earth Sciences, 27:2 (2017), 131-141 (in Russian)
[7] [7] Bocharov V. A., Markin V. I., Syllogistic theories, Progress-Traditsiya, M., 2010, 336 pp.
[8] [8] Shalak V. I., “Syntactic interpretation of categorical attributive propositions”, Logicheskie Issledovaniya, 21:1 (2015), 60-78 (in Russian) · Zbl 1338.03010
[9] [9] Markin V. I., “Syllogistics of actual volumes and logical maintenance of concepts”, Tenth Smirnov Readings on Logic, Proceedings of the International Scientific Conference, Sovremennye tetradi, M., 2017, 90-93 (in Russian)
[10] [10] Finn V. K., “On the non-Aristotelian structure of concepts”, Logicheskie Issledovania, 21:1 (2015), 9-48 (in Russian) · Zbl 1338.68246
[11] [11] Levich A. P., The art and the method in systems’ simulation: variational methods in community ecology, structural and extremal principles, categories and functors, Institute of Computer Science, M.-Izhevsk, 2012, 728 pp.
[12] [12] Vasil’ev S. N., “A method for synthesis of the derivability conditions of the horn and some other formulas”, Siberian Mathematical Journal, 38:5 (1997), 896-906 · Zbl 1042.03527
[13] [13] Vagin V. N., Zo M. Kh., “Parallel inference in the method of analytical tables”, Programmnye Produkty i Sistemy, 2011, no. 3, 8-13 (in Russian)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.