Blake canonical form
In Boolean logic, a formula for a Boolean function f is in Blake canonical form, also called the complete sum of prime implicants, the complete sum, or the disjunctive prime form, when it is a disjunction of all the prime implicants of f. Blake canonical form is a disjunctive normal form.
Blake discussed three methods for calculating the canonical form: exhaustion of implicants, iterated consensus, and multiplication. The iterated consensus method was rediscovered by Samson and Mills, Quine, and Bing.
- Tsutomu Sasao, "Ternary Decision Diagrams and their Applications", in Tsutomu Sasao, Masahira Fujita, eds., Representations of Discrete Functions ISBN 0792397207, 1996, p. 278
- Abraham Kandel, Foundations of Digital Logic Design, p. 177
- Donald E. Knuth, The Art of Computer Programming 4A: Combinatorial Algorithms, Part 1, 2011, p. 54
- Frank Markham Brown, "The Blake Canonical Form", chapter 4 of Boolean Reasoning: The Logic of Boolean Equations, ISBN 0486427854, 2nd edition, 2012, p. 77ff (first edition, 1990)
- "Canonical expressions in Boolean algebra", Dissertation, Dept. of Mathematics, U. of Chicago, 1937, reviewed in J. C. C. McKinsey, The Journal of Symbolic Logic 3:2:93 (June 1938) doi:10.2307/2267634 JSTOR 2267634
|This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.|