Digital Electronics/ 2-valued Boolean algebra and it’s theorem in Digital Logic with easy explanation.

Digital Electronics/ 2-valued Boolean algebra and it’s theorem in Digital Logic with easy explanation.

https://www.gyanodhan.com/video/7B6.%20GATE%20CSEIT/Digital%20Electronics/282.%202-valued%20Boolean%20algebra%20and%20it%27s%20theorem%20in%20Digital%20Logic%20with%20easy%20explanation.mp4

 2-Valued Boolean Algebra & Its Theorems in Digital Logic

What is 2-Valued Boolean Algebra?

Boolean Algebra is a mathematical system used in digital electronics where variables take only two values:
0 (False / LOW)
1 (True / HIGH)

All digital circuits (AND, OR, NOT gates) use Boolean algebra to simplify logic expressions.

 Basic Boolean Operations

1⃣ AND Operation (⋅)

• Symbol: $A\cdot B$ or $AB$
• Truth Table:
  

  A	B	A ⋅ B
  0	0	0
  0	1	0
  1	0	0
  1	1	1

• Example: $1\cdot 1=1,$ $0\cdot 1=0$

2⃣ OR Operation (+)

• Symbol: $A+B$
• Truth Table:
  

  A	B	A + B
  0	0	0
  0	1	1
  1	0	1
  1	1	1

• Example: $1+0=1,$ $0+0=0$

3⃣ NOT Operation (¬ or ‘)

• Symbol: A′A’A′ or $\neg A$
• Truth Table:
  

  A	A’
  0	1
  1	0

• Example: 1′=0,1′ = 0,1′=0, 0′=10′ = 10′=1

 Boolean Algebra Theorems

These theorems help in simplifying logic circuits.

1⃣ Identity Law

• $A+0=A$
• $A\cdot 1=A$

2⃣ Null Law

• $A+1=1$
• $A\cdot 0=0$

3⃣ Idempotent Law

• $A+A=A$
• $A\cdot A=A$

4⃣ Involution Law

• (A′)′=A(A’)’ = A(A′)′=A

5⃣ Complement Law

• A+A′=1A + A’ = 1A+A′=1
• A⋅A′=0A \cdot A’ = 0A⋅A′=0

6⃣ Distributive Law

• $A\cdot (B+C)=(A\cdot B)+(A\cdot C)$
• $A+(B\cdot C)=(A+B)\cdot (A+C)$

7⃣ Absorption Law

• $A+(A\cdot B)=A$
• $A\cdot (A+B)=A$

8⃣ De Morgan’s Theorems

• (A⋅B)′=A′+B′(A \cdot B)’ = A’ + B’(A⋅B)′=A′+B′
• (A+B)′=A′⋅B′(A + B)’ = A’ \cdot B’(A+B)′=A′⋅B′

 Example: Simplify the Expression

Expression: $A+(A\cdot B)$
Using Absorption Law:
$A+(A\cdot B)=A$

So, instead of using a circuit with AND and OR gates, we can directly use A, saving hardware.

 Summary

Boolean Algebra is used in Digital Logic & Circuits.
2-Valued Boolean Algebra uses only 0 & 1.
Boolean Theorems help simplify logic circuits.

Would you like circuit diagrams or more solved examples?

Digital Electronics/ 2-valued Boolean algebra and it’s theorem in Digital Logic with easy explanation.

01. Boolean Algebra and Logic Gates.pmd

UNIT-II Boolean algebra and Logic Gates

Boolean Algebra and Logic Gate