Sets, Lattices, and Classes of Logic Functions

Abstract

Many applications use not only single logic functions but sets of them. It is beneficial when not each function of such a set must be computed separately. A strongly simplified computation is possible when the sets of functions satisfy certain properties. We explore sets of functions that satisfy the rules of an equivalence relation as well sets having the structure of a lattice. Very often used are partially defined functions which describe a lattice of functions that is isomorphic to a Boolean Algebra. These lattices can and must be generalized to express the results of derivative operation of a lattice of logic functions. The Boolean Differential Calculus has been extended for all derivative operations of such generalized lattice of logic functions. The derivative operations of the Boolean Differential Calculus also support the solution of logic equations with regard to variables. These operations are used to specify conditions whether a logic equation can be solved with regard to selected variables or whether such a solution function is even uniquely determined. In general, we get lattices of logic functions as solution of a logic equation with regard to variables. These lattices and their relations to each other can also be calculated using derivative operations. As special application we explain systems of reversible functions. Sets of functions can also be determined by functional equations that contain unknown functions such that lattices of functions satisfy the given equation. More general, a Boolean differential equation can be used to describe an arbitrary set of logic functions. We present a basic algorithm that calculates the set of all solution lattices of a special type of Boolean differential equations and generalize this algorithm for arbitrary sets of logic functions as solution of a Boolean differential equation.