Scribd
Upload
10 views7 pages

PLC Boolean Alegbra

Uploaded by

ryan naidoo
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
10 views7 pages

PLC Boolean Alegbra

Uploaded by

ryan naidoo
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/ 7

Processing and Logic Concepts

UNIT 3 - Boolean Algebra and De Morgan’s Theorem

3.1 Introduction to Boolean Algebra


In mathematics, Boolean algebra is the branch of algebra, that is taught in high school.
Whereas arithmetic of algebra deals with specified numbers, Boolean algebra introduces
quantities without fixed values, known as variables. In Boolean algebra, the values of the
variables are either true or false, and is denoted by 1 and 0. Instead of algebra where the values
of the variables are numbers, and the operations are addition, subtraction, division and
multiplication, the main operations of Boolean algebra are the conjunction (AND), the disjunction
(OR), and the negation (NOT). Boolean algebra has been fundamental in the development of
modern digital electronics.

3.2 Boolean algebra: laws and theorems

Although Boolean algebra has its own set of laws and theorems, it is also governed by the laws
of arithmetic algebra.

© PIHE PLC 1|Page


Order of operations
BODMAS is an acronym and it stands for Bracket, Of, Division, Multiplication, Addition and
Subtraction. It explains the order of operations to solve an expression. According to the rule of
BODMAS, if an expression contains brackets ((), {}, []) we must first solve or simplify the bracket
followed by of (powers/exponents), then division, multiplication, addition and subtraction from left
to right. Solving the problem in the wrong order will result in an incorrect answer.

Using algebra
Before you evaluate an algebraic equation, you need to simplify it. Here are the basic steps to
follow when simplifying an algebraic expression:

1. Remove parentheses by multiplying factors

2. Combine like terms by adding coefficients

3. Combine the constants

Let's work through an example:

5(2 + x) + 3(5x + 4)

When simplifying an expression, the first thing to look for is whether you can clear any
parentheses. Often, you can use the distributive property to clear parentheses, by multiplying the
factors with the terms inside the parentheses. In this expression, we can use the distributive
property to get rid of the first two sets of parentheses.

= 10 + 5x + 15x + 12

The next step in simplifying is to look for like terms and combine them. The terms 5x and 15x are
like terms, because they have the same variable. We can combine these two terms to get 20x.

= 10 + 20x + 12

Finally, we look for any constants that we can combine. Here, we have the constants 10 and 12.
We can combine them to get 22.

= 22 + 20x

© PIHE PLC 2|Page


Boolean Laws and theorems
The following laws and theorems are essential to solving Boolean algebra problems. It is
important for you to know them and be able to apply them where necessary. There are eight
groups of laws and one important theorem (De Morgan’s theorem).

Rule Examples Variable or expression (…)

Identity A+0=A (…) OR 0 is equal to itself

A.1 = A (…) AND 1 is equal to itself

A+1=1 (…) OR 1 is equal to 1

A.0 = 0 (…) AND 0 is equal to 0

Idempotence A+A=A (…) OR itself is equal to itself

A.A = A (…) AND with itself is equal to itself

Complement A + A' = 1 (…) OR its complement is equal to 1

A.A' = 0 (…) AND with its complement is equal to


0

Involution (A')' = A

Commutative A+B=B+A

A.B = B.A

Associative (A + B) + C = A + (B + C)

A.(B.C) = (A.B).C

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

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

Absorption A + A.B = A

© PIHE PLC 3|Page


A.(A + B) = A

Simplification A + A'B' = A + B'


Theorem
A' + AB = A' + B

De Morgan's (A + B + C …)' = A'.B'.C'…


theorem

(A.B.C …)' = A' + B' + C'…

3.2.3.1 AND

The law of AND:

AND LAWS

x.0 = 0

x.1 = x

x.x = x

x.x’ = 0

xy = yx

(xy)z = x(yz)

x + yz = (x + y)(x + z)

x(x + y) = x

(xy)’ = x’ + y’

© PIHE PLC 4|Page


3.2.3.2 OR

The law of OR:

OR LAWS

x+0=x

x+1=1

x+x=x

x + x’ = 1

x+y=y+x

(x + y) + z = x + (y + z)

x (y + z) = xy + xz

x + xy = x

(x + y)’ = x’.y’

3.2.3.3 NOT

In some instances, a condition may be negated more than once. It may have a double negation,
a triple negation, or more. If there is an even number of vincula over the variable, it can be reduced
to equal the variable itself. (No vincula). If there is an odd number of vincula over the variable the
value is equal to the inverse of the variable (1 vinculum)

Above can be written as either OR Ā.

© PIHE PLC 5|Page


3.2.3.4 De Morgan's theorem

De Morgan's theorem may be thought of as breaking 'the bar'. When the bar is broken, the
operation directly underneath changes from addition (OR) to multiplication (AND), or multiplication
(AND) to addition (OR), and the remaining bar piece stays over the individual variables.

The following illustrates this concept.

In short, “Break the line, change the sign”

De Morgan's theorem may be illustrated using the following truth tables:

Using Boolean Algebra:


Simplify A'B'(A'+ B')(B'+ B)

F = A'B'(A' + B)(1)

A'A'B' + A'BB'

A'B' + A'(0)

A'B' + 0

A'B'

Expression: Rule(s) used:

F= xzy + xzy' + x'z Distributive


= xz(y + y') + x'z Uniqueness
= xz(1) + x'z Identity
= xz + x'z Distributive
= z(x + x') Uniqueness
= z(1) Identity
=z

© PIHE PLC 6|Page


Prove A + B + CD + (AB)' = 1

Expression: Rule(s) used:

A + B + CD + (AB)'
= A + B + CD + A' + B' De Morgan’s
= A + A' + B + B' + CD Commutative
= 1 + 1 + CD Uniqueness
=1

© PIHE PLC 7|Page

You might also like