Abstract:
The maximum of a logical function over all possible combinations of values of logical variables of a certain subset is defined, and an algorithm for obtaining it without sorting through all the values is described. Equivalent relations between a logical function and its maximum which facilitate the transformation of such functions are given. There is an example of the use of the algorithm.