BOOLEAN ALGEBRA

GROUP 3 – ELECTRO 2
BSMarE/E-J2A1
OBJECTIVES:
• To know who invented the Boolean Algebra.
• To explain the use of Boolean Algebra.
• To recall the two binary values have different names:
- True/False
- On/Off
- Yes/No
- 1/0
• To interpret high or low voltage as representing true or false.
• To know the variables whose can be either 1 or 0.
• To know the important rules/laws use in Boolean Algebra.
• To know the basic Boolean Operation:
- AND
- OR
- NOT
• To know the different types of Boolean Laws.
• To express Boolean function with either an expressions or
truth table.
• To know and explain the use of Demorgan’s Theorem.
• To simplify Boolean Algebra to Boolean Expression.
BRIEF HISTORY
 Boolean algebra was invented by George
Boole in 1854. Boolean algebra is often referred to
as the algebra of logic. The English mathematician
George Boole (1815–1864), who is largely
responsible for its beginnings, was the first to apply
algebraic techniques to logical methodology. He
showed that logical propositions and their
connectives could be expressed in the language of
set theory. Thus, Boolean algebra is also the
algebra of sets. Algebra is that branch of
mathematics which is concerned with the relations
of quantities.
WHAT IS BOOLEAN
ALGEBRA?
• Boolean algebra, a logic algebra, allows the rules used in the
algebra of numbers to be applied to logic. It formalizes the
rules of logic. Boolean algebra is used to simplify Boolean
expressions which represent combinational logic circuits. It
reduces the original expression to an equivalent expression
that has fewer terms which means that less logic gates are
needed to implement the combinational logic circuit.
• As well as the logic symbols “0” and “1” being used to
represent a digital input or output, we can also use them as
constants for a permanently “Open” or “Closed” circuit or
contact respectively.

• A set of rules or Laws of Boolean Algebra expressions have

been invented to help reduce the number of logic gates
needed to perform a particular logic operation resulting in a list
of functions or theorems known commonly as the Laws of
Boolean Algebra.
• Boolean Algebra is the mathematics we use to analyze digital
gates and circuits. We can use these “Laws of Boolean” to both
reduce and simplify a complex Boolean expression in an
attempt to reduce the number of logic gates required. Boolean
Algebra is therefore a system of mathematics based on logic
that has its own set of rules or laws which are used to define
and reduce Boolean expressions.

• The variables used in Boolean Algebra only have one of two

possible values, a logic “0” and a logic “1” but an expression
can have an infinite number of variables all labelled individually
to represent inputs to the expression, For example, variables A,
B, C etc., giving us a logical expression of A + B = C, but each
variable can ONLY be a 0 or a 1.
RULES OF BOOLEAN
ALGEBRA
This are the following important rules used in Boolean algebra:

•Variable used can have only two values. Binary 1 for HIGH and
Binary 0 for LOW.

•Complement of a variable is represented by an overbar (-). Thus,

complement of variable B is represented as . Thus if B = 0 then =
1 and B = 1 then = 0.

•ORing of the variables is represented by a plus (+) sign between

them. For example ORing of A, B, C is represented as A + B + C.

•Logical ANDing of the two or more variable is represented by writing

a dot between them such as A.B.C. Sometime the dot may be
omitted like ABC.
LAWS OF BOOLEAN
ALGEBRA
Annulment Law – A term AND´ed with a “0” equals 0 or OR´ed with a “1” will equal 1

A . 0 = 0 A variable AND’ed with 0 is always equal to 0

A + 1 = 1 A variable OR’ed with 1 is always equal to 1

Identity Law – A term OR´ed with a “0” or AND´ed with a “1” will always equal that term

A + 0 = A A variable OR’ed with 0 is always equal to the variable

A . 1 = A A variable AND’ed with 1 is always equal to the variable

Idempotent Law – An input that is AND´ed or OR´ed with itself is equal to that input

A + A = A A variable OR’ed with itself is always equal to the variable

A . A = A A variable AND’ed with itself is always equal to the variable

Complement Law – A term AND´ed with its complement equals “0” and a term OR´ed with its
complement equals “1”

A . A = 0 A variable AND’ed with its complement is always equal to 0

A + A = 1 A variable OR’ed with its complement is always equal to 1
Commutative Law – The order of application of two separate terms is not important

A . B = B . A The order in which two variables are AND’ed makes no difference

A + B = B + A The order in which two variables are OR’ed makes no difference

Double Negation Law – A term that is inverted twice is equal to the original term

A=A A double complement of a variable is always equal to the variable

de Morgan´s Theorem – There are two “de Morgan´s” rules or theorems,

(1) Two separate terms NOR´ed together is the same as the two terms inverted
(Complement) and AND´ed for example: A+B = A . B

(2) Two separate terms NAND´ed together is the same as the two terms inverted
(Complement) and OR´ed for example: A.B = A + B
Other algebraic Laws of Boolean not detailed above include:

Distributive Law – This law permits the multiplying or factoring out of an expression.

A(B + C) = A.B + A.C (OR Distributive Law)

A + (B.C) = (A + B).(A + C) (AND Distributive Law)

Absorptive Law – This law enables a reduction in a complicated expression to a simpler

one by absorbing like terms.

A + (A.B) = A (OR Absorption Law)

A(A + B) = A (AND Absorption Law)

Associative Law – This law allows the removal of brackets from an expression and
regrouping of the variables.

A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)

A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Boolean Algebra Functions
Using the information above, simple 2-input AND, OR and NOT Gates can be represented by 16 possible functions as shown
in the following table.
Function Description Expression

1. NULL 0

2. IDENTITY 1

3. Input A A

4. Input B B

5. NOT A A

6. NOT B B

7. A AND B (AND) A.B

8. A AND NOT B A.B

9. NOT A AND B A.B

10. NOT AND (NAND) A.B

11. A OR B (OR) A+B

12. A OR NOT B A+B

13. NOT A OR B A+B

14. NOT OR (NOR) A+B

15. Exclusive-OR A. B +A. B

16. Exclusive-NOR A. B +A. B

Laws of Boolean Algebra Example No.1
Using the above laws, simplify the following expression: (A + B)(A + C)

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

A.A + A.C + A.B + B.C – Distributive law

A + A.C + A.B + B.C – Idempotent AND law (A.A = A)

A(1 + C) + A.B + B.C – Distributive law

A.1 + A.B + B.C – Identity OR law (1 + C = 1)

A(1 + B) + B.C – Distributive law

A.1 + B.C – Identity OR law (1 + B = 1)

Q= A + (B.C) – Identity AND law (A.1 = A)

Then the expression: (A + B)(A + C) can be simplified to A + (B.C) as in the Distributive law.