Issue No. 03 - March (1968 vol. 17)
Abstract?A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva's determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time. The procedure requires the computation of irredundant coverings, and novel features of the algorithm which was used to carry out this computation are also described.
Index terms?Complete sets, irredundant coverings, logical functions, minimal coverings, programming.
G. Sethares and S. Petrick, "On the Determination of Complete Sets of Logical Functions," in IEEE Transactions on Computers, vol. 17, no. , pp. 273, 1968.