Scribd
Upload
49 views

Boolean Algebra: Boolean Logic, or Boolean Algebra As It Is Called Today, Was

Boolean algebra was developed by George Boole in the 19th century based on the concepts of TRUE and FALSE. It uses Boolean expressions and logic gates to achieve desired outputs using the fewest number of gates. Boolean algebra has postulates like X = 0 or 1 and laws like the commutative, associative, distributive, identity, and redundancy laws. It is used by engineers to design circuits and simplify complex logic expressions.

Uploaded by

Marvin Sinues
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Boolean Algebra: Boolean Logic, or Boolean Algebra As It Is Called Today, Was

Boolean algebra was developed by George Boole in the 19th century based on the concepts of TRUE and FALSE. It uses Boolean expressions and logic gates to achieve desired outputs using the fewest number of gates. Boolean algebra has postulates like X = 0 or 1 and laws like the commutative, associative, distributive, identity, and redundancy laws. It is used by engineers to design circuits and simplify complex logic expressions.

Uploaded by

Marvin Sinues
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Boolean Algebra

Boolean logic, or Boolean algebra as it is called today, was


developed by an English mathematician, George Boole, in the
19th century. He based his concepts on the assumption that
most quantities have two possible conditions - TRUE and
FALSE.

A Boolean expression is nothing more than a description of


the input conditions necessary to get the desired output.
These expressions are based on Boole's laws and theorems.
Purpose

Boolean algebra is used primarily by design engineers.


Using this system, they are able to arrange logic gates
to accomplish desired tasks. Boolean algebra also
enables the engineers to achieve the desired output by
using the fewest number of logic gates. Since space,
weight, and cost are important factors in the design of
equipment, you would usually want to use as few parts
as possible.
Logic Simplification

A. Complex series of gates

B. Simplified single OR gate


Boolean Postulates

P1: X = 0 or X = 1
P2: 0 . 0 = 0
P3: 1 + 1 = 1
P4: 0 + 0 = 0
P5: 1 . 1 = 1
P6: 1 . 0 = 0 . 1 = 0
P7: 1 + 0 = 0 + 1 = 1
Laws of Boolean Algebra

T1 : Commutative Law
(a) A + B = B + A
(b) A B = B A

T2 : Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A B) C = A (B C)

T3 : Distributive Law
(a) A (B + C) = A B + A C
(b) A + (B C) = (A + B) (A + C)
Laws of Boolean Algebra
T4 : Identity Law
(a)A + A = A
(b)A A = A

T5 : Redundance Law
• A+AB=A
• A (A + B) = A

T6 :
(a)0 + A = A
(b)0 A = 0

T7 :
(a)1 + A = 1
(b)1 A = A
Laws of Boolean Algebra
Example #1

Prove T9 : (a)

(1) Algebraically:
Cont. of Example #1

(2) Using the truth table:


Cont. of Example #1
Using the laws given above, complicated expressions can
be simplified.
Example #2
Simplify the expression below using the Boolean algebra:

You might also like