U.SAMYKANNU

   CANONICAL FORMS          Two dual  canonical forms  of any  Boolean  function are a  "sum of min terms "   and  a "product of max terms. "              The term "Sum of Products" (SoP or SOP) is widely used for the  canonical form  that is a dis junction (OR) of min terms.              The  SOP  (Sum of Product) and   POS  (Product of Sum) are  the methods for deducing a particular logic function . ...                      The prior difference between the  SOP and POS  is that the  SOP  contains the OR of the multiple product terms.  Conversely,  POS  produces a logical expression comprised of the AND of the multiple OR terms.        SOP Vs POS       CANONICAL FORMS OF SUM OF PRODUCT :                 Canonical  SoP  form  means  Canonical  form  of  Sum of Products.   In this  form , each  product  term contains all literals.  So, these  product  terms are  nothing but the min terms.  Hence,  canonical  SoP  form  is also called as  sum  of min terms 

BOOLEAN ALGEBRA                    Boolean algebra was introduced by  George Boole  in his first book  " The Mathematical Analysis of Logic  (1847),"  and set forth more fully in his  An Investigation of the Laws of Thought  (1854).                        According to  Huntington , the term "Boolean algebra" was first suggested by  Sheffer  in 1913, although  Charles Sanders Peirce  gave the title "A Boolean Algebra with One Constant" to the first chapter of his "The Simplest Mathematics" in 1880. [4]  Boolean algebra has been fundamental in the development of  digital electronics , and is provided for in all modern programming languages. It is also used in  set theory  and  statistics .           In mathematics and mathematical  logic ,  Boolean algebra  is the branch of  algebra   in which the values of the variables are the truth values  true and false, usually denoted 1 and 0,  respectively.       USES :           Boolean Algebra  is  used to