Irredundant Disjunctive and Conjunctive Forms of a Boolean Function

摘要

A thorough algebraic method is described for the determination of the complete set of irredundant normal and conjunctive forms of a Boolean function. The method is mechanical and therefore highly programmable on a computer.