Rules of Boolean algebra for simplification

Boolean algebra is a very useful method for simplification of binary expressions. There is no connection between the general algebra we know and the Boolean algebra. Boolean algebra deals with the binary bits only. There are different laws of Boolean algebra to simplify the Boolean expressions. In this article, we are going to discuss all rules of Boolean algebra for simplification of Boolean functions.

Rules of Boolean algebra

Let A, B, C…. etc. be the binary bits. Then the laws of Boolean algebra to simplify binary equations consist of these binary bits and their complements are as followings-

Addition form

  1. 1+A = 1
  2. 1+\small \bar{A} = 1
  3. A+\small \bar{A} = 1
  4. A+\small \bar{A}B = A+B

Multiplication form

  1. A.A = A
  2. A.\small \bar{A} = 0
  3. AB = BA

Examples for simplification of Boolean expression by Boolean algebra

1. Simplify the binary expression using Boolean algebra: \small {\color{Red} Y = (AB + A\bar{B} + C)}.


\small {\color{blue} Y = (AB + A\bar{B} + C)}

or, \small {\color{Blue} Y = A(B+\bar{B})+C}

Then, \small {\color{Blue} Y = A+C}

This is the simplified form of the Boolean expression.

2. Simplify the Boolean expression \small {\color{Red} Y = (1 + A\bar{B} + B)} by using Boolean algebra.


\small {\color{blue} Y = AB + A\bar{B} + C}

or, \small {\color{Blue} Y= 1 + A + B}. [ Since, \small A\bar{B}+B = A+B ]

or, \small {\color{Blue} Y= 1 + B}. [ Since, 1+A = 1].

or, \small {\color{Blue} Y= 1 }.

These are the rules for simplification of Boolean algebra in digital electronics. This all from this article. If you have any further query you can ask me in the comment section.

Thank you!

Related Posts:

  1. Karnaugh map for simplification of Boolean expressions
  2. Basic logic gates
  3. XOR gate

3 thoughts on “Rules of Boolean algebra for simplification”

Leave a Comment