Open AccessSystems of Inclusions with Unknowns in Multioperations
Author(s) -
N. A. Peryazev,
AUTHOR_ID
Publication year - 2021
Publication title -
izvestiâ irkutskogo gosudarstvennogo universiteta. seriâ "matematika"/izvestiâ irkutskogo gosudarstvennogo universiteta. seria matematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.411
H-Index - 3
eISSN - 2541-8785
pISSN - 1997-7670
DOI - 10.26516/1997-7670.2021.38.112
Subject(s) - mathematics , boolean algebras canonically defined , superposition principle , representation (politics) , complete boolean algebra , two element boolean algebra , completeness (order theory) , reduction (mathematics) , parity function , boolean expression , algebra over a field , discrete mathematics , algorithm , boolean function , pure mathematics , mathematical analysis , algebra representation , geometry , politics , political science , law
We consider systems of inclusions with unknowns and coefficients in multioperations of finite rank. An algorithm for solving such systems by the method of reduction to Boolean equations using superposition representation of multioperations by Boolean space matrices is given. Two methods for solving Boolean equations with many unknowns are described for completeness. The presentation is demonstrated by examples: the representation of the superposition of multioperations by Boolean space matrices; solving a Boolean equation by analytical and numerical methods; and finding solutions to an inclusion with one unknown. The resulting algorithm can be applied to the development of logical inference systems for multioperator logics.