Publication
IEEE TC
Paper

On the Determination of Complete Sets of Logical Functions

View publication

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. Copyright © 1968 by The Institute of Electrical and Electronics Engineers, Inc.

Date

01 Jan 1968

Publication

IEEE TC

Authors

Share