Lecture 3
Lecture 3
• AND
• OR
• NOT
2-input AND gate
A A &
A.B A.B
B B
A B A.B
0 0 0
0 1 0
1 0 0
1 1 1
2- input OR gate
A A
A+B A+B
B B
A B A+B
0 0 0
0 1 1
1 0 1
1 1 1
NOT gate (Inverter)
A A' A A'
A A'
0 1
1 0
Some Other Gates
• NAND
• NOR
• XOR
• XNOR (equivalence)
2-input NAND gate
A
(A.B)' ≡ A
(A.B)'
A &
(A.B)'
B B B
A B (A.B)'
0 0 1
≡
0 1 1
1 0 1 NAND Negative-OR
1 1 0
2-input NOR gate
A
(A+B)' ≡ A
(A+B)'
A
(A+B)'
B B B
A B (A+B)'
0 0 1
0 1 0 ≡
1 0 0 NOR Negative-AND
1 1 0
2-input XOR gate
A A =1
A⊕B A⊕B
B B
A B A⊕B
0 0 0
0 1 1
1 0 1
1 1 0
Boolean Algebra
• Like any other deductive mathematical
system, defined with a set of elements, a set
of operators and a number of axioms or
postulates.
Proof of 1(a):
x+x = (x + x).1 (identity)
= (x + x).(x + x') (complementarity)
= x + x.x' (distributivity)
=x+0 (complementarity)
=x (identity)
Basic Theorems of Boolean Algebra
• 2-5,2-6,2-11