Editing Canonical normal form (section)

==Further reading==
* {{cite book |first1= Edward A. |last1= Bender |first2= S. Gill |last2= Williamson |date= 2005 |title= A Short Course in Discrete Mathematics |publisher= Dover Publications, Inc. |location= Mineola, NY |isbn= 0-486-43946-1 |quote= <br />The authors demonstrate a proof that any Boolean (logic) function can be expressed in either disjunctive or conjunctive normal form (cf pages 5–6); the proof simply proceeds by creating all 2<sup>''N''</sup> rows of ''N'' Boolean variables and demonstrates that each row ("minterm" or "maxterm") has a unique Boolean expression. Any Boolean function of the ''N'' variables can be derived from a composite of the rows whose minterm or maxterm are logical 1s ("trues") }}
* {{cite book |first= E. J. |last= McCluskey |date= 1965 |title= Introduction to the Theory of Switching Circuits |publisher= McGraw–Hill Book Company |location= NY |lccn= 65-17394 |quote= Canonical expressions are defined and described |page= 78 }}
* {{cite book |first1= Fredrick J. |last1= Hill |first2= Gerald R. |last2= Peterson |date= 1974 |title= Introduction to Switching Theory and Logical Design |edition= 2nd |publisher= John Wiley & Sons |location= NY |isbn= 0-471-39882-9 |quote= Minterm and maxterm designation of functions |page= 101 }}