The Development of Suitable Inequalities and Their Application to Systems of Logical Equations.

In this paper, two not-difficult inequalities are invented and proved in detail, which adequately describe the behavior of discrete logical functions x o r (x 1 ,   x 2 , ... ,   x n) and a n d (x 1 ,   x 2 , ... ,   x n) . Based on these proven inequalities, infinitely differentiable extensions of the logical functions x o r (x 1 ,   x 2 , ... ,   x n) and a n d (x 1 ,   x 2 , ... ,   x n) were defined for the entire ℝ n . These suitable extensions were applied to systems of logical equations. Specifically, the system of m logical equations in a constructive way without adding any equations (not field equations and no others) is transformed in ℝ n first into an equivalent system of m smooth rational equations (S m S R E) so that the solution of S m S R E can be reduced to the problem minimization of the objective function, and any numerical optimization methods can be applied since the objective function will be infinitely differentiable. Again, we transformed S m S R E into an equivalent system of m polynomial equations (S m P E) . This means that any symbolic methods for solving polynomial systems can be used to solve and analyze an equivalent S m P E . The equivalence of these systems has been proved in detail. Based on these proofs and results, in the next paper, we plan to study the practical applicability of numerical optimization methods for S m S R E and symbolic methods for S m P E . [ABSTRACT FROM AUTHOR]