In recent years, various methods and directions for solving a system of Boolean algebraic equations have been invented, and now they are being very actively investigated. One of these directions is the method of transforming a system of Boolean algeb...
In connection with applications, the solution of a system of logical equations plays an important role in computational mathematics and in many other areas. As a result, many new directions and algorithms for solving systems of logical equations are...
Many of the applied algorithms that have been developed for solving a system of logical equations or the Boolean satisfiability problem have solved the problem in the Boolean domain. However, other approaches have recently been developed and improved...
We use the HHL algorithm to retrieve a quantum state holding the algebraic normal form (ANF) of a Boolean function. Unlike the standard HHL applications, we do not describe the cipher as an exponentially big system of equations. Rather, we perform a...
This paper proposes a methodology for the design of fuzzy inference systems based on Boolean relations. The approach using Boolean sets presents limited performance due to the abrupt transitions that occur during its functioning, therefore, fuzzy set...
This manuscript proves specific theorems for transforming Boolean expressions of logical formulas when moving from one basis to another, simplifying the solution of complex equations, especially for cryptographic applications. The paper develops meth...
This paper continues a series of papers on unification constructions. After a short discussion on the Euler’s relation, we introduce a matrix version of the Euler’s relation,
In the study of algebraic structures related to logical systems, ideals and filters have different meanings and are algebraic notions related to logical provable formulas. Unlike the classical Boolean lattice theory, ideals and filters are not dual n...