Laws Of Boolean Algebra

Excess-3 to BCD logic diagram

Laws Of Boolean Algebra

The Laws Of Boolean Algebra is provided here.

OR

A + 0 = A

A + A’ = 1

A + B = B + A

A (B + C) = AB + AC

A + A = A

A + 1 = 1

A + AB = A

A + (B + C) = (A + B) + C

A” = A

AND 

A . 1 = A

A . A’ = 0

A . B = BA

A + BC = (A + B) (A + C)

A . A = A

A . 0 = 0

A (A + B) = A ,     ( AA+ AB = A, A + AB = A)

A (BC) = (AB) C

Distributive Law: 

A . (B + C) = (A . B) + (A . C)

A + (B . C) = (A + B) . (A + C)

Associative Law: 

A + (B + C) = (A + B) + C

A . (B .C) = (A . B) . C

Demorgan’s Theorem: 

1. (AB)’ = A’ + B’

The product of the compliment is equal to the sum of the compliments

Proof:

ABA’B’(AB)(AB)’A’ + B’
0011011
0110011
1001011
1100100

 

2.(A + B)’ = A’ . B’

The sum of the compliment is equal to the product of the compliments.

Proof: 

ABA’B’(A + B)(A + B)’A’. B’
0011011
0110100
1001100
1100100

 

 

 

 

 

 

Newsletter

Join my forum
About ABISHEK 60 Articles
Publisher of this blog Hey zZooMers,  I am Abishek from India. I just started this blog to provide information about Electrical and Electronics Engineering. You can surely expect many more from my side. Here I write about Basics, Electrical, Electronics, News related to Tech and safety which should be followed in Engineering. If you don’t want to miss any information, Just subscribe to my blog.

Leave a Reply

abishek