Chapter Three

LOGIC
Introduction

Logic is a systematic approach of determining whether a given statement is true

or false.

Logic is the mathematical concepts used to draw a conclusion whether the

given statement is true or false.

Logic deals with reasoning and judgement of statement whether to be true or

false, judgement is only applied for statements.

Sometimes logic is called mathematical Reasoning.

Mathematical reasoning is the study of reasoning through the use of

mathematical symbols.

Application of Logic

(i) It is used in computer programming and designing of machines.

(ii) It is used in electric circuit and in entertainment (Logic puzzles).
(iii) To weigh pros and cons of the decision.
(iv) The power of reasoning differentiate humans from animal.
(v) The successful lawyer can win a case in a court by strong reasoning.

3.1 SENTENCE AND STATEMENT

Sentence is a basic unit of language that express a complete thought.

This is a set of word that is complete in itself, it can be in terms of questions,
exclamations or commands, prediction e.t.c.

Examples
(i) Amina is the most beautiful girl in the class.
(ii) Tanzanians are the best in pure mathematics.

61
Statement is a group of words which can be judged to be true or false but not
both.
Example
 Naomi is beautiful
 Mayombya likes Mathematics
 Eva is tall but Salome is fat
 Two is greater than four
 Dodoma is a capital city of Tanzania.
 Every square is a rectangle .

NB. Every statement is sentence but not every sentence is a statement,

Proposition is a representative letter in which it carries two meanings of either

being true or false eg p, q, r, s etc
Proposition is a sentence that is either true or false but not both.
Types of logical statements
Logical statements are categorized into two types which are
(i) Simple logical statement
Simple logical statement is a single logical statement or is a statement which is
complete in its meaning and does not require the connective words like “and,
but, then,…”
Example
 Obama is active
 Kikwete is competent
 Four is even number
 Peter is writing
 Malema is speaking

(ii) Compound logical statement

Compound statement is the combination of two or more simple statements, or is
the statement which is joined by the connective words like “and, but, then,…”
Example
 Joseph is thin and Joyce is charming
 Joyce is writing and Peter is reading
 The sun is bright and hot
 Mathematics is simple and interesting subject
Truth Value is the truth or falsity of a statement.
62
If the statement is true then its truth value is TRUE or T and if the statement is
false then its truth value is FALSE or F.
Truth table is the table which used to show the validity of the compound
statement, or is a table used to determine specific truth values of a given logical
statement.

3.2 LOGICAL CONNECTIVES

(a) Logical connectives in a compound statement
These are connectives in logic which are used in joining simple statements to
form compound statements, or Logical connective are connectives used to
connect simple logical statements to make up logical compound statement.

Logical connectives are categorized as follows

(i) Conjunction ( )
Conjunction is the connective which connect two or more simple statements
and compound statement formed is said to be true if and only if all propositions
are true. Connective words which stands for conjunctions are and, but, both,
while, when, e.t.c

Conjunction is denoted by 
Example 1
The sky is blue and the grass is green.
Let p  The sky is blue
q  The grass is green
Connective is ' and'  
Symbolically is p  q

Example 2
Draw the truth table of p  q
Solution
p q pq

T T T

T F F

F T F

F F F

63
Example 3
Draw the truth table of  p  q   r
Solution
p q r pq  p  q  r
T T T T T

T F T F

T F T F F

T F F F F

F T T F F

F T F F F

F F T F F

F F F F F

(ii) Disjunction ( )
Disjunction is the connective in which the statement is said to true if at least
one proposition is true.
Connective words which stands for Disjunctions are or, either or, etc.

Disjunction is denoted by 

Example 4
Robert is reading or writing
Let p  Robert is reading
q  Robert is writing
connective is ' or'  
Symbolically is p  q

64
Example 5
Draw the truth table of p  q
Solution
p q pq

T T T

T F T

F T T

F F F

(iii) Conditional (Implication) ( )

Condition is the connective in which one proposition implies another
proposition.
Connective words which stands for Condition are if….then…, only if..,
necessary for.., therefore…, sufficient for.., implies, necessary, whenever,
condition, etc
eg. If p and q are two simple statements
In conditional probability this can be expresed as one of the following statements,
(i) p implies q i.e. p  q 
(ii) If p, then q
(iii) p is necessary for q
(iv) q whenever p
(v) A necessary condition of p is q
(vi) A sufficient condition for q is p

 The compound statement p  q is said to be false if p is true and q is false

otherwise is true.

65
Example 6
If you study hard then you will pass an examination.
Solution
p  You study hard
q  You will pass an examination
Connective word is " If....then....."
 If p then q  p  q

Example 7
Draw the truth table of p  q
Solution
p q pq

T T T

T F F

F T T

F F T

(iv) Bi-condition (Double implication ) ( )

The logical statement is said to be true if and only if all proposition are either
true or false.
Connective words which stands for Bi-condition are “if and only if, sufficient
and necessary for, etc
Bi-condition or double implication is denoted by 

Example 8
You can take the flight if and only if you buy a ticket.
p  you can take the flight
q  you buy a ticket
Connective word is "iff "
 p iff q  p  q

66
Example 9
Draw the truth table of p  q
Solution
p q pq

T T T

T F F

F T F

F F T

(v) Negation
This is the opposite of the stated statement, and denoted by ~
If p is a given statement, its negation is ~ p

Example 10
 Peter is clever  p 
 Peter is not clever ~ p 

Consider the table below

Statement Negation
p ~p
q ~q
pq ~  p  q

T F
F T

67
OTHER LOGICAL CONNECTIVES
This involves two common connectives namely as
(a) Exclusive disjunction
A mathematical statement is said to be exclusive disjunction if the results of the
truth table is said to be true if one of them is true but not both otherwise is false.
The exclusive disjunction of p and q is denoted by pq read as either
p or q but not both of them.
Example 11
Draw the truth table of pq
Solution
p q pq

T T F
T F T
F T T
F F F

(b) Joint denial

Joint denial is the connective in which the truth table results is said to be true
only if both are false otherwise false.
Joint denial is denoted by 
The joint denial of p and q is written as p  q .
p  q read as neither p nor q

Example 12
Draw the truth table of p  q
Solution
p q pq

T T F
T F F
F T F
F F T

68
3.3 TRUTH TABLES FOR SIMPLE AND COMPOUND STATEMENTS
Simple and compound statements can be expressed in symbolic form,
Let p = first proposition, q  second proposition, r  third proposition etc ,
then connect the symbols by using the specified connectives. Now from
symbolic logic connectives its possible to draw the truth table.
Example 13
Change into symbolic logical form and draw the truth table of the statement
“If I am clever then I understand logic”
Solution
Let P= I am clever
q= I understand logic
In symbolic form p  q
Truth table
p q pq

T T T

T F F

F T T

F F T

Example 14
Change into symbolic logical form and draw the truth table of the statement
“If today is Monday then tomorrow is Tuesday”
Solution
Let P= today is Monday
q= tomorrow is Tuesday
In symbolic form p  q
Truth table
p q pq

T T T

T F F

F T T

F F T

69
Example 15
Change into symbolic logical form and draw the truth table of the statement
“If I like Mathematics or I study then I will pass”
Solution
Let P= I like mathematics
q= I study
r= I will pass
In symbolic form  p  q   r
Truth table
p q r p  q  p  q  r

T T T T T

T T F T F

T F T T T

T F F T F

F T T T T

F T F T F

F F T F T

F F F F T

Example 16
Change into symbolic form the statement “If my brother stands first in the class,
I will give him a phone. Either he stands first or I was out of station. I didn’t
give my brother a phone this time. Therefore I was out of station”
Solution
Let P= He stands first in the class
q= I will give him a phone
r= I was out of station
 Symbolic logical form  p  q    p  r  ~ q  r

70
 Equivalent of propositions
Two or more propositions are said to be equivalent if they have the same truth
value on the truth table.

Example 17
Determine whether the sentences p  q and q  p are equivalent.
Solution
p q pq q p

T T T T

T F T T

F T T T

F F F F

From the table above the column for p  q is the same as the column for q  p .
 The given propositions are equivalent ie. p  q  q  p  .

Example 18
Determine whether the sentences p  q and ~ p  q are equivalent.
Solution
p q ~ p p  q ~ pq

T T F T T

T F F F F

F T T T T

T F F T T

From the table above the column for p  q is the same as the column
for ~ p  q .
 The given propositions are equivalent ie. p  q ~ p  q  .

71
 Example 19
Determine whether the sentences p  q and  p  q   q  p  are
equivalent.
Solution
p q pq q p pq  p  q   q  p 
T T T T T T

T F F T F F

F T T F F F

T F F T T T

From the table above the column for p  q is the same as the column
for  p  q   q  p  .
 The given propositions are equivalent  p  q    p  q   q  p 

Example 20
Determine whether the sentences p  q and ~ p  q   ~ q  p  are
equivalent.
Solution
p q ~p ~q ~ pq ~ q p pq ~ p  q   ~ q  p 

T T F F T T T T

T F F T F T F F

F T T F T F F F

T FT FT T T T

From the table above the column for p  q is the same as the column
for ~ p  q   ~ q  p  .
 The given propositions are equivalent  p  q   ~ p  q   ~ q  p 

72
3.4 Tautologies, contradictions and equivalent statements
(i) Tautology
A compound statement is said to be tautology if it contains all True values
(T) in the last column of its truth table.

(ii) Contradiction
A compound statement is said to be contradiction if it contains all False
values (F) in the last column of its truth table.

(iii)Logical contigency
A compound statement is said to be contigent if it contains at least one T
and F in each row of its truth table.

(iv) Fallacy
Fallacy is the incorrect argument in logic or incorrect reasoning

3.5 Converse, contrapositive and inverse of a given statements

We can define the converse, the contrapositive and the inverse of a conditional
statement. We start with the conditional statement “If p then q .”

 The converse of the conditional statement is “If q then p .”

 The contrapositive of the conditional statement is “If not q then
not p .”
 The inverse of the conditional statement is “If not p then
not q .”

We will see how these statements work with an example. Suppose

we start with the conditional statement “If it rained last night, then
the sidewalk is wet.”

 The converse of the conditional statement is “If the sidewalk is

wet, then it rained last night.”
 The contrapositive of the conditional statement is “If the
sidewalk is not wet, then it did not rain last night.”
 The inverse of the conditional statement is “If it did not rain last
night, then the sidewalk is not wet.”

73
(i) Converse of the conditional statement
Converse is the reverse of conditional statement.
If p  q is the conditional statements then its converse is q  p .
i.e.
Statement p  q
Converse q  p

(ii) Contrapositive of the conditional statement

Contrapositive is the opposite measuring converse of conditional statement.
If p  q is the conditional statements then its contrapositive is ~ q ~ p .
i.e.
Statement pq
Converse q p
Contrapositive ~ q ~ p

(iii) Inverse of the conditional statement

Inverse is the converse of the contrapositive.
If p  q is the conditional statements then its inverse is ~ p ~ q .
i.e.
Statement pq
Converse q p
Contrapositive ~ q ~ p
Inverse ~ p ~ q

Example 21
Write the converse, contrapositive and inverse of the statement “If Juma is a
poet, then he is poor”
Solution
Converse “If Juma is poor, then he is a poet”
Contrapositive “If Juma is not poor, then he is not a poet”
Inverse “If Juma is not a poet, then he is not poor”

Example 22
Write the converse, contrapositive and inverse of the statement “If it rains, then
they cancel school.”
Solution
Converse "If they cancel school, then it rains."
Contrapositive "If they do not cancel school, then it does not rain."
Inverse “If it does not rain, then they do not cancel school.”
74
Example 23
Write the converse, contrapositive and inverse of the statement “If two angles
are congruent, then they have the same measure.”
Solution
Converse “If two angles have the same measure, then they are congruent.”
Contrapositive “If two angles do not have the same measure, then they are not
congruent.”
Inverse “If two angles are not congruent, then they do not have the same
measure.”

Example 24
Write the converse, contrapositive and inverse of the statement “If a
quadrilateral is a rectangle, then it has two pairs of parallel sides.”
Solution
Converse “If a quadrilateral has two pairs of parallel sides, then it is a
rectangle.”
Contrapositive “If a quadrilateral does not have two pairs of parallel sides, then
it is not a rectangle.”
Inverse “If a quadrilateral is not a rectangle, then it does not have two pairs of
parallel sides.”

Example 25
Write the converse, contrapositive and inverse of the statement “If a person is
18 years old, then he is a legal adult.”
Solution
Converse “If a person is a legal adult, then he is 18 years old.”
Contrapositive “If a person is not a legal adult, then he is not 18 years old.”
Inverse “If a person is not 18 years old, then he is not a legal adult.”

75
3.6 LAWS OF ALGEBRA OF PROPOSITION
The following are laws of algebra used to simplify propositions;

(i) Commutative law

 pq q p
 pr  r p

(ii) Associative law

 p  q  r    p  q   r
 p  q  r    p  q   r

(iii)Distributive law
 p  q  r    p  q    p  r 
 p  q  r    p  q    p  r 

(iv) Identity law

 p T  p
 p T T
q  F  F
q F  q

(v) Compliment law

 p~ p F
 p ~ p T

(vi) De-Morgan’s law

 ~  p  q  ~ p  ~ q
 ~  p  q  ~ p  ~ q

(vii) Idempotent law

 p p  p
q q  q

(viii) Modulus law (absorption law)

 p   p  q  p
 p   p  q  p

76
Example 26
Use the algebra propositions to simplify the following expression
 p  q   p  q
Solutions
 p  q    p  q .......... .......... .......... .......... ..given
 p  q   q  p    p  q .......... .......... ......by defition
~ ~ p  q   ~ q  p   ~ p  q .......... .......... ..by defition
~ ~ p  q  ~ ~ q  p  ~ p  q .......... .......... Demorgan's law
~ ~ p  q   ~ p  q  ~ ~ q  p .......... .......... commutative law
T  ~ ~ q  p .......... .......... .......... .......... .......... ..complement law
T .......... .......... .......... .......... .......... .......... .........identity law

Example 27
Determine whether the following proposition is a tautology
 p ~ q   q  r   p  r
Solution
 p ~ q   q  r   p  r.......... .......... ..given
~ ~ p ~ q   q  r   p   r.......... .......... by definition
~ ~ p ~ q   p  q  r   r.......... .......... commutative law
~ ~ p  p   ~ q  p   q  r   r.......... ..distributive law
~ F  ~ q  p   q  r   r.......... ............ complement law
~ ~ q  p   q  r   r.......... ............ ......iden tity law
~ ~ q  p  ~ q  r   r.......... ............ ....Demorgan' s law
q ~ p   ~ q  ~ r   r.......... ............ ....Demorgan' s law
q ~ p   ~ q  r   ~ r  r .......... ........dist ributive law
q ~ p   ~ q  r   T .......... ............ .....compliment law
q ~ p   ~ q  r .......... ........... .......... ...identity law
q ~ q   ~ p  r .......... ........... .......... ...commutative law
T  ~ p  r .......... ........... .......... .......... ..complement law
T .......... ........... .......... .......... .......... .........i dentity law

77
Example 28
Simplify the following using laws  p   p  q  ~ p
Solution
 p   p  q  ~ p.......... .......... .......... .given
~  p   p  q  ~ p.......... .......... .......... by definition
~ p  ~  p  q  ~ p.......... .......... .......... Demorgan's law
~ p  ~ p ~ q  ~ p.......... .......... ........ Demorgan's law
~ p  F   ~ p ~ q  ~ p.......... .......... identity law
~ p  F  ~ q  ~ p.......... .......... .......... distributive law
~ p  F  ~ p.......... .......... .......... .......... identity law
~ p ~ p.......... .......... .......... .......... ........identity law
~ p.......... .......... .......... .......... .......... .......idempotent law

Example 29
Simplify by using law of algebra  p  q   q
Solution
 p  q   q.......... .......... .......given
~  p  q   q.......... .......... ....... by definition
~ p ~ q   q.......... .......... .....Demorgan law
~ p  ~ q  q .......... .......... .....associative law
~ p  T .......... .......... .......... .....complement law
T .......... .......... .......... .......... ....identity law

Example 30
Simplify by using law of algebra  p   p  q  ~ p
Solution
 p   p  q  ~ p.......... .......... ..given
~  p   p  q  ~ p.......... .......... .by definition
~ p  ~  p  q  ~ p.......... ......... Demorgan law
~ p  ~ p ~ q  ~ p.......... ......Demorgan law
~ p  F   ~ p ~ q  ~ p........identity law
~ p  F  ~ q  ~ p.......... .........distributive law
~ p  F  ~ p.......... .......... .........identity law
~ p ~ p .......... .......... .......... .....identity law
~ p.......... .......... .......... .......... .....idempotent law

78
Example 31
Simplify the following proposition by deductive reasoning  p  q   ~ q  p 
Solution
   
p  q  ~ q  p .......... .......... ....given
~  p  q  ~ ~ q  p .......... ......... by definition
~ p  ~ q   q  ~ p .......... ......... Demorgan's law
~ p  ~ p   ~ q  q .......... ......... commutative law
~ p  ~ q  q .......... .......... ......... idempotent law
~ p  F .......... .......... .......... ......... complement law
F .......... .......... .......... .......... .......identity law

Exercise 3.1
1. Simplify the expression  p  q   q by using algebra laws
2. Simplify the following by using algebra laws ~  p  q   ~ p  q 

3.7 VALIDITY OF ARGUMENT

An argument is the combination of different compound statements (or
premises), or an argument is a sequence of premises (or propositions) together
with its conclusion.
i.e. P1  P2  P3      Pn   Conclusion

Validity means valid or invalid of logical statement.

The argument can be valid (Tautology) invalid (Contradiction/fallacy)
VALID ARGUMENT
A valid argument is an argument which is always true, or an argument which
the truth of its premises entire the truth of its conclusion.

Principle of Validity
The premises represented by P1  P2  P3      Pn are joined using connective
“and” or “  ” and the conclusion is given by words like “Thus” or “Therefore”
and denoted by “  ” an implication.
i.e. P1  P2  P3      Pn   Conclusion

79
Example 32
Check if the following argument is valid “If I am clever then I understand
Logic. I don’t understand Logic. Therefore I am not clever”
Solution
Let p  I am clever
q  I understand Logic
Compound statement  p  q  ~ q  ~ p
p q ~ p ~ q p  q  p  q  ~ q  p  q  ~ q ~ p

T T F F T F T

T F F T F F T

F T T F T F T

F F T T T T T

 Hence the argument is valid because it is TAUTOLOGY

Alternative
 p  q  ~ q ~ p
~  p  q  ~ q  ~ p By definition
~ ~ p  q  ~ q  ~ p By definition
~ ~ p  q   q ~ p De Morgan' s law
 p  ~ q   q ~ p De Morgan' s law
 p  q   ~ q  q  ~ p Distributive law
 p  q   T  ~ p Complement law
 p  q  ~ p Identity law
q  p  ~ p Commutative law
q   p ~ p  Associative law
qT Complement law
T Identity law
 Hence the argument is valid because it is TAUTOLOGY

80
Example 33
Determine whether the following proposition is true or not
 p  ~ q   q  r   p  r by using laws.
Solution
 p  ~ q   q  r   p  r.......... .......... ......... given
~  p  ~ q   q  r   p   r.......... .......... ........ definition
~  ~ p  ~ q   q  r   p   r.......... .......... ......definition
~  ~ p  ~ q   p  q  r   r.......... .......... ......commutative law
~ ~ p  p   ~ q  p   q  r   r.......... .......... distributive law
~ F  ~ q  p   q  r   r.......... .......... .......... .complement law
~ ~ q  p   q  r   r.......... .......... .......... .......identity law
~ ~ q  p  ~ q  r  r.......... .......... .......... .....demorgan's law
q ~ p   ~ q  ~ r  r.......... .......... .......... .....demorgan's law
q ~ p   ~ q  ~ r   r .......... .......... .......... .....associative law
q ~ p   ~ q  r   ~ r  r .......... .......... ........distributive law
q ~ p   ~ q  r   T .......... .......... .......... .......complement law
q ~ p   ~ q  r .......... .......... .......... .......... ....identity law
q ~ q   ~ p  r .......... .......... .......... .......... ....commutative law
T  ~ p  r .......... .......... .......... .......... .......... ....complement law
T .......... .......... .......... .......... .......... .......... .......... .identity law

Exercise 3.2
1. Test the validity of the following arguments p  ~ q , ~ r  q , r  ~ p
2. Test the validity of the following argument p  ~ q, r  q, q Ⱶ ~ r

3.8 ELECTRICAL NETWORKS

This is the application of logic statement to check the flow of current
from one terminal to another.
That is

81
Point to note in electrical networks
(i) The current will flow from T1 to T2 only if the switch is closed and
not otherwise.
(ii) The current may not flow from T1 to T2 only if the switch is open
and not otherwise.
(iii) The flow of current is denoted by T while not flow of current is
denoted by F .
(iv) Negation always implies opening of switch and its vice versa is
true.

Connection of Switches
There are two connections of switches namely;
(a) Series connection
(b) Parallel connection

(a) Series connection

Series connection is the connection at which two or more switches
are connected in a single line.
Example

In series connection the flow of current is possible if and only if all

switches are closed.
Series connection use conjunction   connective.
That is;

Logically is represented by p  q

Logically is represented by p  q  r

Logically is represented by p  q  ~ r no flowing of current.

82
(b) Parallel connection
Parallel connection is the connection in which two or more
switches are connected in a side way.
Series connection use disconjunction   connective.

Parallel connection of two switches

Logically is represented by p  q

Parallel connection of three switches

Logically is represented by p  q  r

In parallel connection the current may flow only if at least one of

them is closed.
Note:
For the case of complex switches (both series and parallel
connections) apply brackets to symbolize.
Example 34
Construct the network for  p  q   r
Solution

83
Example 35
Construct the network for  p  q   r
Solution

Example 36
Construct the network for p  q  r   s
Solution

Example 37
Construct the network for p  q  r   s
Solution

Example 38
Construct the network for  p  q   r  s 
Solution

84
Example 39
Construct the network for p  q
Solution
p  q  ~ p  q   ~ q  p 

Alternative

Example 40
Draw the electrical network for the proposition ~  p  q   ~ p  q 
Solution
~  p  q   ~ p  q 
~  p  q   ~ p  q   ~ p ~ q   ~ p  q ........De Morgan' s law

Alternative electrical network

Example 41
Use the laws of algebra of proposition to simplify the statement
q   p ~ q   r  q  and hence draw the corresponding simple
electrical network.
Solution

85
q   p  ~ q   r  q .......... ......given
q  p   q ~ q   r  q ......... distributive law
q  p   T  r  q .......... ........ .compliment law
q  p   r  q .......... ........ .......ide ntity law
q  p   q  r .......... ........ .......commutative law
q   p  r .......... ........ .......... .....distributive law

Example 42
Use the laws of algebra to simplify the statement
p  q  r  ~ q   ~ p ~ r  and hence draw the corresponding simple
electrical network.
Solution
p  q  r  ~ q   ~ p  ~ r .......... .......... .......... ......given
p  q  r   q  ~ q   ~ p  ~ r .......... .......... ......... distributive law
p  q  r   F  ~ p  ~ r .......... .......... .......... ........ complement law
p  q  r   ~ p  ~ r .......... .......... .......... ........ ......iden tity law
 p  q  r   ~ p  ~ r .......... .......... .......... .......... ......asso ciative law

Alternative electric circuit

86
Example 43
Simplify the logical proposition below and draw its corresponding electrical
network r  ~ p  q   p
Solution
r  ~ p  q   p .......... .......... .......... ......given
r   p  q   p .......... .......... .......... .......... by definition
r   p  p   q  p .......... .......... .......... ..distributive law
r   p  q  p .......... .......... .......... .......... idempotent law
r   p  T   q  p .......... .......... .......... ...identity law
r   p  T    p  q .......... .......... .......... ...commutative law
r   p  T  q .......... .......... .......... ...........di stributive law
r   p  T .......... .......... .......... ............. ......iden tity law
r  p.......... .......... .......... ............. .......... ....identi ty law

Example 44
Determine the compound statement in words from the table below. Hence
draw electric diagram for the statement.
M N PM , N 

T T F
T F F
F T T
F F F
Solution
Circle T from P in the truth table
~M N

Alternative

87
Example 45
Draw a simple network diagram corresponding to the statement of the
following truth table
x y z p

T T T F
T T F F
T F T
T F F T
F T T F
F T F T
F F T T
F F F T

Solution
On circling F
~ x ~ y ~ z   ~ x ~ y  z   x ~ y ~ z .........given
~ x ~ y   ~ z  z   x ~ y ~ z ......... .......... .....distributive law
~ x ~ y   F   x ~ y ~ z ......... .......... .......... .....complement law
~ x ~ y   x ~ y  ~ z ......... .......... .......... .......... ..identity law
~ y ~ x   ~ y  x ~ z ......... .......... .......... .......... ..commutative law
~ y  ~ x  x ~ z ......... .......... .......... .......... .......... distributive law
~ y  ~ x  x   ~ x  ~ z ......... .......... .......... .......... distributive law
~ y  F  ~ x  ~ z ......... .......... .......... .......... .......... complement law
~ y  ~ x  ~ z ......... .......... .......... .......... .......... .......ide ntity law

88
 Example 46
A statement J is formed from P, G and M . Write J in most simplified
form and use it to draw an electric circuit which will allow the current to
flow whenever J is true
P G M J

T T T T
T T F T
T F T
T F F T
F T T T
F T F F
F F T F
F F F F

Solution
P  G  M   P  G  ~ M   P ~ G  M   P ~ G  ~ M   ~ P  G  M .......... given
P  G  M   P  G  ~ M  P ~ G  M   P ~ G  ~ M  ~ P  G  M .......given
P  G   M  ~ M  P ~ G   M  ~ M  ~ P  G  M .......... .......... distributive law
P  G   T  P ~ G   T  ~ P  G  M .......... .......... .......... .......... .......complement law
P  G   P ~ G  ~ P  G  M .......... .......... .......... .......... .......... .......... ..identity law
P  G ~ G  ~ P  G  M .......... .......... .......... .......... .......... .......... .........d istributive law
P  T  ~ P  G  M .......... .......... .......... .......... .......... .......... .......... .......... complement law
P  ~ P  G  M .......... .......... .......... .......... .......... .......... .......... .......... ........id entity law
P ~ P   P  G  M .......... .......... .......... .......... .......... .......... .......... .........d estributive law
T  P  G  M .......... .......... .......... .......... .......... .......... .......... .......... .........c omplement law
P  G  M .......... ......... .......... .......... .......... .......... .......... .......... .......... .......ide ntity law

89
Example 47
Draw the electrical diagram corresponding to the statement ~  p  q   q  p 
Solution
~  p  q   q  p .......... .......... .......... .......... ...given
~ p ~ q   q  p .......... .......... .......... .......... Demorgan's law

Example 48
Draw a simple network for q   p ~ q   r  ~ p 
Solution
q   p  ~ q   r  ~ p .......... .......... .......... .....given
q  p   q ~ q   r  ~ p .......... .......... ..... .distributive law
q  p   T   r  ~ p .......... .......... ..... .......... .complement law
q  p   r  ~ p .......... .......... ..... .......... ........id entity law
q  p   r   q  p  ~ p.......... .......... ........di stributive law
q  p   r   q   p ~ p .......... .......... ........as sociative law
q  p   r   q  T .......... .......... .......... ........co mplement law
q  p   r   T .......... .......... .......... .......... ......iden tity law
q  p  r.......... .......... .......... .......... .......... .....ident ity law

90
Example 49
Draw a simple network for s p, q, r  having the truth table shown below.
p q r s
T T T T
T T F F
T F TT
T F F F
F T T F
F T F F
F F T F
F F F F
Solution
Circle T from the compound statement s from the table
 p  q  r    p  ~ q  r .......... .......... .......... ......... given
 p  r  q    p  r  ~ q .......... .......... .......... ......... commutative law
 p  r   q ~ q .......... .......... .......... .......... .......... distributive law
 p  r   T .......... .......... .......... .......... .......... .......... complement law
 p  r .......... .......... .......... .......... .......... .......... .....ident ity law

Exercise 3.3
1. Simplify the following by using laws, then draw a circuit diagram
 p  q   ~  p  r   q  r 
2. Write in symbolic form the compound statement which represents the
following circuit diagram, where T1 and T2 are terminals

3. Draw the electrical circuit network of p  q  r   r  s 

91