Scribd
Upload
89 views29 pages

Boolean Algebra (Binary Logic) : Theorem

The document describes Boolean algebra theorems. It begins by stating common theorems such as A+0=A, A+1=1, and A+A=A. It then works through simplifying the expression A'B' + A'B + AB = Z using Boolean algebra rules and properties. It eventually simplifies the expression down to 1=Z by using the distributive, identity, and inverse properties of Boolean algebra.

Uploaded by

Kareem Dad Mahar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views29 pages

Boolean Algebra (Binary Logic) : Theorem

The document describes Boolean algebra theorems. It begins by stating common theorems such as A+0=A, A+1=1, and A+A=A. It then works through simplifying the expression A'B' + A'B + AB = Z using Boolean algebra rules and properties. It eventually simplifies the expression down to 1=Z by using the distributive, identity, and inverse properties of Boolean algebra.

Uploaded by

Kareem Dad Mahar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Boolean Algebra (Binary Logic)

Theorem

A+0=A
A+1=1
Boolean Algebra (Binary Logic)
Theorem

A+0=A
A+1=1
A+A=A
A + A’ = 1
Boolean Algebra (Binary Logic)
Theorem

A+0=A A*0=0
A+1=1 A*1=A
A+A=A
A + A’ = 1
Boolean Algebra (Binary Logic)
Theorem

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0
Boolean Algebra (Binary Logic)
Theorem

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A
B) (A + C) = A + BC
Boolean Algebra (Binary Logic)
A B C AB AC AB+AC B+C A(B+C)
AB + AC = A(B + C)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Boolean Algebra (Binary Logic)
A B C AB AC AB+AC B+C A(B+C)
AB + AC = A(B + C)
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
Boolean Algebra (Binary Logic)
A B C AB AC AB+AC B+C A(B+C)
AB + AC = A(B + C)
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 0 0
1 0 0 0 0
1 0 1 0 1
1 1 0 1 0
1 1 1 1 1
Boolean Algebra (Binary Logic)
A B C AB AC AB+AC B+C A(B+C)
AB + AC = A(B + C)
0 0 0 0 0 0
0 0 1 0 0 0
0 1 0 0 0 0
0 1 1 0 0 0
1 0 0 0 0 0
1 0 1 0 1 1
1 1 0 1 0 1
1 1 1 1 1 1
Boolean Algebra (Binary Logic)
A B C AB AC AB+AC B+C A(B+C)
AB + AC = A(B + C)
0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 0 1 0
0 1 1 0 0 0 1 0
1 0 0 0 0 0 0 0
1 0 1 0 1 1 1 1
1 1 0 1 0 1 1 1
1 1 1 1 1 1 1 1
Boolean Algebra (Binary Logic)
AB + AC = A(B + C)

A
B
AB + AC
A
C
Boolean Algebra (Binary Logic)
AB + AC = A(B + C)

A
B A
A(B + C)
AB + AC B
A C
C
Boolean Algebra (Binary Logic)
AB + AC = A(B + C)

A
B A
A(B + C)
AB + AC B
A C
C

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z

A’
B’

A’
Z
B

A
B
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( )

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( )
A’(1) + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( )
A’(1) + AB = Z
A’ + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( )
A’(1) + AB = Z
A’ + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z
A’ + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z A’B’ + A’B + A’B + AB = Z
A’ + AB = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z A’B’ + A’B + A’B + AB = Z
A’ + AB = Z (A’B’ + A’B) + (A’B + AB) = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z A’B’ + A’B + A’B + AB = Z
A’ + AB = Z (A’B’ + A’B) + (A’B + AB) = Z
A’(B’ + B) + (A’ + A)B = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z A’B’ + A’B + A’B + AB = Z
A’ + AB = Z (A’B’ + A’B) + (A’B + AB) = Z
A’(B’ + B) + (A’ + A)B = Z
A’(1) + (1)B = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = Z A’B’ + A’B + AB = Z
A’(B’ + B) + AB = Z
( ) A’B’ + (A’B + A’B) + AB = Z
( )
A’(1) + AB = Z A’B’ + A’B + A’B + AB = Z
A’ + AB = Z (A’B’ + A’B) + (A’B + AB) = Z
A’(B’ + B) + (A’ + A)B = Z
A’(1) + (1)B = Z
A’ + B = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = A’ + B = Z

A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC
Boolean Algebra (Binary Logic)
A’B’ + A’B + AB = A’ + B = Z

A’
B’

A’ A’
Z Z
B B

A
B
A+0=A A*0=0
A+1=1 A*1=A
A+A=A A*A=A
A + A’ = 1 A * A’ = 0

A+B=B+A A*B=B*A
(A + B) + C = A + (B + C) (A * B) * C = A * (B * C)
AB + AC = A(B + C) (A + B)*(A + C) = A + BC

You might also like