15 views

Uploaded by Saritha

Boolean Algebra

- 1.Develop a synchronous service for addition of two numbers (1).docx
- Ch4_v02
- parekh2014.pdf
- Comparator
- DigitalTutorial Design
- Optical Quadruple Feynman Gate using SLM and Savart Plate
- Truth Table Creator
- Discrete Mathematics - LOGIC - Sample Exercises - Questions
- Syllabus
- 20133 Math10 Syllabus Edigner Gail 2635
- Ac31graf Gb v213 plc
- Lecture 11 Combinational Logic Design
- BSC (IT) Semester 2
- MAT117+Syllabus+July+2011[1]
- Infinite Smarandache Groupoids
- The Unwinding: An Inner History of the New America
- Sapiens: A Brief History of Humankind
- The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good Life
- Shoe Dog: A Memoir by the Creator of Nike
- Never Split the Difference: Negotiating As If Your Life Depended On It

You are on page 1of 7

3 Boolean Algebra

In the previous section we looked at the eight logical operations: and, or, not,

exclusive-or, nand, nor, if-then and if-and-only-if. In this section we shall look at the

algebra of these operations. Recall, from the last section

For example, (p + q)(pq)' and pq' + p'q are logical expressions. Often we use a capital

letter, e.g. P or Q, to denote a logical expression. For example, we might write

P = (p + q)(pq)' or Q = pq' + p'q. In the following we shall just say expression for logical

expression if there is no danger of confusion with other types of exprssions such as

arithmetic expressions or mixed arithemetic/logical expressions.

Expressions are equivalent if they give the same result for every possible

combination of logical values for the logical variables appearing in them.

This occurs precisely if they have the same truth table. We write P = Q if P and Q are

equivalent. In the previous section we showed that (p + q)(pq)' = pq' + p'q.

identity.

Some of the equivalences that we showed in the previous section were the following.

(2) p nor q = (p + q)' = p'q'

(3) p q = (p q)(q p) = (p q)'

The right equivalences in (1) and (2) are called the DeMorgan laws. Here is a list of

some useful identities in Boolean algebra. The DeMorgan identities on the right of (1)

and (2) are included as formulas (7) in this list.

(5) p(qr) = (pq)r p + (q + r) = (p + q) + r associative laws

(6) p(q + r) = pq + pr p + (qr) = (p + q)(p + r) distributive laws

(7) (pq)' = p' + q' (p + q)' = p'q' DeMorgans laws

(8) p1 = p p+0 = p identity laws

(9) p0 = 0 p+1 = 1 domination laws

(10) pp = p p+p = p idempotent laws

(11) pp' = 0 p + p' = 1 negation laws

1.3 - 1

(12) (p')' = p double negation law (or involution law)

One of the main reasons we are interested in equivalences is because they give us

alternative ways to design logic circuits.

whose output is r = q + p'q'. r = q + p'q'

(11) and (8) we have

p

So a simpler circuit to produce r is the one at the r = q + p'

right.

q

whose output is r = q + p'q. r = q + p'q

(8) and (9) we have

For more applications of Boolean algebra to logic design, see Fundamentals of Logic

Design by Charles H. Roth, Jr. and published by Thomson.

Some of the equivalences in the list (4) (12) follow directly from the definition.

Consider pq = qp. The left side pq is 1 only if both p and q are 1. The right side qp is 1

only if both q and p are 1. However both p and q are 1 precisely if both q and p are 1. So

pq and qp are 1 under the same circumstances. So pq = qp.

The equivalences that are less obvious can be shown to be true using truth tables.

Example 3. Show the first distributive law is valid using a truth table.

p q r q+r p(q + r) pq pr pq + pr

At the right is the truth 0 0 0 0 0 0 0 0

table. Note that both 0 0 1 1 0 0 0 0

p(q + r) and pq + pr are 0 1 0 1 0 0 0 0

0 1 1 1 0 0 0 0

true precisely in the last 1 0 0 0 0 0 0 0

three rows, i.e. in the 1 0 1 1 1 0 1 1

following three cases. 1 1 0 1 1 1 0 1

1 1 1 1 1 1 1 1

1.3 - 2

p = 1, q = 0, r = 1

p = 1, q = 1, r = 0

p = 1, q = 1, r = 1

The equivalences (4) (11) are examples of dual pairs of equivalences. Every logical

expression has a dual expression that is obtained by interchanging and and or and 0 and

1. For example, the dual of the expression p(q + r) is p + qr. One way to get the dual of

an expression is to do the following three steps.

1. complement the expression

2. Use the DeMorgan laws

3. Replace each variable by its complement

For example, if we do that with p(q + r) we get the following.

p' + q'r' p + qr

If two expressions are equivalent then the duals of the two expressions are equivalent. So

in each of the equivalence (4) (11) the right equivalence follows from the left and vice-

versa.

Example 4. Go through this argument to prove the commutative law for "or" from the

commutative law for "and".

We start with the commutative law for and, i.e. pq = qp. Next we not both sides giving

(pq)' = (qp)'. Next we use the first DeMorgan law giving p' + q' = q' + p'. Since this

holds for all p and q we can replace p by p' and q by q', giving p'' + q'' = q'' + p''. Finally

we use (12) which gives p + q = q + p.

In this argument we used some properties of equivalences that we usually use without

taking note that we are actually using them. Here are three useful properties of

equivalences.

First, suppose P = Q and P and Q contain the logical variable p and R is another

expression. If we replace all occurrences of p in P and Q by R the resulting expressions

are equivalent. In symbols

and similarly for Q//pR. We used (13) to go from p' + q' = q' + p' to p'' + q'' = q'' + p''.

some occurrences of P in R by Q then the resulting expression is equivalent. In symbols

1.3 - 3

Here R/PQ denotes the expression obtained by replacing some, but not necessarily all,

occurrences of P in R by Q. We used (14) to go from p'' + q'' = q'' + p'' to p + q = q + p.

Third, two expressions equivalent to the same expression are equivalent. In symbols

The commutative and associative laws are similar in structure to the commutative and

associative laws in regular algebra. So is the first of the two distributive laws in (6), i.e.

p(q + r) = pq + pr. However, the second, p + (qr) = (p + q)(p + r), is not true in regular

algebra. This is one thing that distinguishes Boolean algebra from regular algebra. The

reason p + (qr) = (p + q)(p + r) is called a distributive law is because it is obtained from

the first distributive law p(q + r) = pq + pr by interchanging + and ..

Problem 1. Make a truth table showing the second distributive law is valid. Show that

both sides are true in the last five rows if the first three columns are the same as the above

truth table.

Example 1. Suppose

q = the Lions win

r = the Red Wings win

(16) The Pistons win and either the Lions win or the Red Wings win

has the form p(q + r). The distributive law p(q + r) = pq + pr says that (16) is equivalent

to

(17) Either both the Pistons and Lions win or both the Pistons and Red Wings win

The pistons win, the Lions lose, the Red Wings win

The pistons win, the Lions win, the Red Wings lose

The pistons win, the Lions win, the Red Wings win

Example 2. On a certain river there are two sets of rapids. To go past the first set of

rapids boats must go through lock A. For the second set of rapids boats can choose

between lock B and lock C.

1.3 - 4

lock B

lock A lock C

To get by both sets of rapids boats must go through lock A and either lock B or lock C.

So to get by both sets of rapids the following statement must be true.

If we let

p = "Lock A is working"

q = "Lock B is working"

r = "Lock C is working"

then (18) has the form p(q + r). By the first distributive law this is equivalent to pq + pr.

Thus an alternative condition for a boat to get by both sets of is the following statement

be true.

Either both locks A and B are working or both locks A and C are working.

The algebra of exclusive-or. In many cases and, or and not are regarded as the most

basic of the logical operations and expressions involving the other operations are reduced

to expressions involving and, or and not. In which case the identities (4) (12) play an

important role. However, in some cases it is convenient to work with exclusive or. In

that case the following identities involving exclusive or are useful. Some of these are

similar to regular or while others are different.

(19) pq = qp commutative

(20) p (q r) = (p q) r associative

(21) p(q r) = pq pr distributive

(22) p0 = p zero is an identity

(23) pp = 0 p is its own inverse

(24) p 1 = p' exclusive or'ing with 1 inverts

(25) p p' = 1

1.3 - 5

(19), and (22) (25) can be proved using the definition of exclusive or. For example, the

commutative property is true since p q is 1 if exactly one of p and q is 1 and the same

is true for q p. Similarly, p 0 is 1 if exactly one of p and 0 is 1, i.e. if p is 1.

The associative and distributive properties can be shown to be true either using truth

tables or by expressing exclusive or in terms of and, or and not using p q = pq' + p'q

and using (4) (12).

p q r qr p (q r)

0 0 0 0 0

0 0 1 1 1

0 1 0 1 1

0 1 1 0 0

1 0 0 0 1

1 0 1 1 0

1 1 0 1 0

1 1 1 0 1

Now consider (p q) r. Using the commutative property for exclusive or, one has

(p q) r = r (p q). The right side has the form p (q r) but p, q and r are

replace by r, p and q respectively. From (26) it follows that r (p q) is 1 if an odd

number of r, p and q are 1. However, this occurs if an odd number of p, q and r are 1. So

p (q r) and (p q) r are both 1 if an odd number of p, q and r are 1. So they are

equivalent.

Remark 1. Because exclusive or satisfies the associative law we usually don't use

parentheses if we are exclusive or'ing more than two things. For example, we write

p q r for both p (q r) and (p q) r.

Let's show that this holds for n = 4. The proof of the general case is the same. Consider

p q r s. We want to show that

1.3 - 6

There are four cases. The first case is when p q r has an even number of 1's and

s = 0. Then p q r = 0 and p q r s = 0 and p q r s has an even number

of 1's. So (28) is true in the first case.

The second case is when p q r has an even number of 1's and s = 1. Then

p q r = 0 and p q r s = 1 and p q r s has an odd number of 1's. So

(28) is true in the second case.

The third case is when p q r has an odd number of 1's and s = 0. Then p q r = 1

and p q r s = 1 and p q r s has an odd number of 1's. So (28) is true in the

third case.

The last case is when p q r has an odd number of 1's and s = 1. Then p q r = 1

and p q r s = 0 and p q r s has an even number of 1's. So (28) is true in

this case.

Solution. We could do this with a truth table. However, let's do by expressing exclusive

or in terms of and, or and not and using properties (4) (12). In section (1.2) we showed

that p q = pq' + p'q. Using this one has

and

pq pr = pq(pr)' + (pq)'pr

Using DeMorgan, some of the other properties (4) (12) one has

= pqp' + pqr' + p'pr + q'pr

= pp'q + pqr' + pp'r + pq'r

= 0q + pqr' + 0r + pq'r

= 0 + pqr' + 0 + pq'r

= pqr' + pq'r

So p(q r) and pq pr are equivalent to the same thing and hence are equivalent.

1.3 - 7

- 1.Develop a synchronous service for addition of two numbers (1).docxUploaded bysree_sree
- Ch4_v02Uploaded bynagaraju
- parekh2014.pdfUploaded byMoid
- ComparatorUploaded byamta1
- DigitalTutorial DesignUploaded byPrabakaran Ellaiyappan
- Optical Quadruple Feynman Gate using SLM and Savart PlateUploaded byEditor IJRITCC
- Truth Table CreatorUploaded byLaime Carrillo
- Discrete Mathematics - LOGIC - Sample Exercises - QuestionsUploaded byLiezel Lopega
- SyllabusUploaded byPham Co
- 20133 Math10 Syllabus Edigner Gail 2635Uploaded bySkyezine Via Kit Fox
- Ac31graf Gb v213 plcUploaded bygustavo mercado
- Lecture 11 Combinational Logic DesignUploaded byabyanbofanda
- BSC (IT) Semester 2Uploaded byvikas singla
- MAT117+Syllabus+July+2011[1]Uploaded byLisa Schnabel
- Infinite Smarandache GroupoidsUploaded byMia Amalia

- Gerbang Dasar LogikaUploaded byrinaldi
- ANSYS Mechanical APDL Introductory Tutorials huy kljhlkjhlkUploaded byPeja Jusoh
- Pneumatic Instruction SetUploaded bywars600
- R7220203 Linear Digital IC ApplicationsUploaded bysivabharathamurthy
- Logic Gates TheoryUploaded byAnkit Vatsa
- Digital CircuitsUploaded byKumar Amit Verma
- List of Boolean Algebra Topics - WikipediaUploaded byaditya00012
- WorksheetUploaded byBharadwaja Yathirajam
- AddersUploaded bymurlak37
- Embedded SystemsUploaded byMayank Nandwani
- Boo Lean Algebra NotesUploaded byMAKIBOY
- Aspects of Soft Computing, Intelligent Robotics and ControlUploaded byAlan Pinho
- sop_posUploaded byMarssel Satya Adi Pratama
- L1 Demo DemorganUploaded byVelu Samy
- תכן לוגי מתקדם- הרצאה 1 | IntroductionUploaded byRon
- Digital PDF docUploaded bygvnchiru
- 7 Boolean Algebra.pdfUploaded byM R Fajar Setiawan
- Coordination and NegationUploaded byMB
- Zissios SystemDesignWithMicroprocessors TextUploaded bytekellamerZ aka tekellamer
- anomalies in firewall policyUploaded byLeoKuriakose
- 1.03 12.F.1.O.003.II Discrete Mathematics EnUploaded byCalin Daniel
- Claude ShannonUploaded byhaseen_a
- Capitulo 3.pdfUploaded byDarwin Alexander Sampedro
- TM241TRE.30-ENG_Function Block Diagramm (FBD)_V3090.pdfUploaded byKaueKoschitzRoratto
- Logics Expt 2Uploaded byAmiel Guevarra
- LogicalUploaded bydee
- Chapter 2Uploaded bystephen562001
- tita pakiprintUploaded byMarian Khj Amora
- Digital Logic GatesUploaded byClarissa Alarcon
- Lessionplan(BE)Uploaded byjayashreedash