Accession Number : AD0631074
Title : ON THE THEORY OF BOOLEAN FORMULAS: SHORTEST AND PRIME FORMULAS.
Descriptive Note : Physical and mathematical science research papers,
Corporate Author : AIR FORCE CAMBRIDGE RESEARCH LABS L G HANSCOM FIELD MASS
Personal Author(s) : Samson,E. W. ; Calabi,L.
Report Date : FEB 1966
Pagination or Media Count : 25
Abstract : The notion of prime implicant is defined and studied at a high level of generality. All the usual results are preserved and deepened and some new ones obtained. Paramount are those relating prime implicants and shortest sums. This theoretical development may be applied to the minimization of Boolean formulas built from formulas of an arbitrarily given set S (for example, the set of formulas realized by devices of a particular kind) and representing a given incomplete switching function. Several computational processes are briefly discussed. The general theory is supplemented by results particular to the 'classical' case in which S is the set of the products of literals. (Author)
Descriptors : (*ALGEBRAS, THEORY), SET THEORY, MATHEMATICAL LOGIC
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE