Friday, December 16, 2016

Boolean algebra equations

Boolean algebra equations can be built from meet, join, and complementation based upon the distributive law and the fact that complementation is an involution. These boolean algebra formulas can be put into conjuctive normal form or disjunctive normal form based upon which lattice operation is going to be at the highest level of nesting. These boolean algebra equations are applicable to any boolean algebra rather it is truth values or entire sets. Propositional logic formulas then can be defined based upon the principles of boolean algebra.

No comments:

Post a Comment