MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Chapter 5. Fundamentals of Logic

Learning Outcomes: to be able to

 define & form (compound) statement logical connectives
 use truth table or laws of logic to determine the truth value of statements and logical equivalence
 use truth table or rules of inference to determine the validity of an argument

5.1 Statements and Logical Connectives

Statement (Proposition): A declarative sentence that is either true or false but not both. A primary
(simple) statement is a statement that can be represented by a variable, like P, Q, R, S or p, q, r, s. The
truthfulness or falsity of a statement is called its truth value. A true statement has truth value T or 1, a
false statement has truth value F or 0.

Eg 1: Which of the following are statements? For a statement, find its truth value.
a) The earth is round. => A TRUE statement.
b) 2 + 3 = 6. => A FALSE statement.
c) Segamat is a big city. => A FALSE statement. (By any known standard.)
d) What a beautiful flower! => NOT a statement. (Expression of personal view.)
e) Is Mr. Lau thin or fat? => NOT a statement. (It is a question.)
f) Take two aspirins. => NOT a statement. (It is an instruction.)

Statements can be combined by logical connectives to obtain compound statements. The truth value
depends on the types of connectives use. Statements without logical connectives are also known as
primary statements.

Eg 2: “The sun is shining or I am taking my shower” is a compound statement. The primary statements
are “The sun is shining” and “I am taking my shower”.

Truth Table
- a table giving the truth values of a compound statement in terms of the truth values of its component
parts.
- each component statement has 2 possible truth values, T and F.
- if there are n component statements in the compound statement, then the number of rows in its truth
table is 2n.

Types of Connectives
1. Conjunction (and, )
Let p and q be two primary statements, the conjunction of p and q is the compound statement “p and q”,
denoted p  q. It is true when both p and q are true, and is false otherwise.

p q pq
NOTE: For compound statements,
T T T
always put the truth value right below
T F F
the (correct) connectives that we use to
F T F determine the truth values.
F F F

1
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Eg 3: Determine the truth value of the conjunction of p and q for each of the followings.
a) p: It’s snowing. q: I am not Malaysian. => F  F = F. So, p  q is a false statement.
b) p: 2 < 3. q: -5 > -8. => T  T = T. So, p  q is a true statement.

c) P: Students taking MAT210 are registered under program CS110.

Q: Students taking MAT210 are doing Diploma in Actuarial Science.

 P  Q = T  F = F. So, P  Q is a false statement.

2. Disjunction (or, )
The disjunction of p and q is the compound statement “p or q”, denoted p  q. It is true if at least one
of p or q is true, and is false otherwise.

p q pq
T T T
T F T
F T T
F F F

Eg 4: Determine the truth value of the disjunction of p and q for each of the following.
a) P: I study mathematics. Q: I am a UiTM student.
b) P: 2 + 3 = 5. Q: Segamat is located in Melaka.

a) T  T = T So, P  Q is a true statement.

b) T  F = T So, P  Q is a true statement.

3. Negation (not, ~)
The negation of a statement p is not p, denoted ~p. ~p is true (or false) when p is false (or true).

Eg 5: Give the negation of the following statements and determine its truth value.
a) P: 2 + 3 > 1. Here, P is a true statement.
b) P: The sun is a cold planet. Here, P is a false statement.

a) ~P: 2 + 3  1 OR 2 + 3 is NOT greater than 1 OR It’s not true that 2+3 > 1. So, ~P is false.
b) ~P: The sun is a hot planet. OR The sun is not a cold planet. OR It’s not true that the sun is a
cold planet. So, ~P is true.

4. Conditional Statement / Implication (If … then…., … implies …, )

The statement “If p then q” or “p implies q”, denoted p  q is called a conditional statement or
implication. Statement p is called the hypothesis (premise), and q is called the conclusion. p  q is false
if only if “p is true and q is false”.

NOTE: In daily conversation, if we say p implies q, then there is a cause-and-effect relationship between
p and q. In mathematics, p  q is true doesn’t mean that there is a cause-and-effect relationship between
p and q. Here, p and q can be 2 unrelated statements.

2
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

p q pq
T T T
T F F
F T T
F F T

Eg 6:
“If I am your lecturer, then you all are my students” is obviously True.
“If I am your lecturer, then you all are older than me” is False since the conclusion is false.
“If I am your father, then 2 + 3 = 5” is True since the conclusion is true.
“If I am your father, then you are all my children” is definitely True though both hypothesis and
conclusion are false.

Eg 7: “If you come on Sunday, then I will employ you.” is false only when you come on Sunday and I
don’t employ you.

(a) “You come on Sunday” is T, and “I employ you” is T  Keep promise

(b) “You come on Sunday” is T, and “I employ you” is F  Not keeping promise
(c) “You come on Sunday” is F, and “I employ you” is T  Not lying.
(d) “You come on Sunday” is F, and “I employ you” is F  Not lying.

5. Biconditional statement (…if and only if …, )

p  q is equivalent to (p  q)  (q  p), and read as p if and only if (iff) q. It is true only when both p
and q have the same truth value.

p q pq (p  q)  (q  p)
T T T T T T
T F F F F T
F T F T F F
F F T T T T

Eg 8: Write the biconditional statement for the given primary statements.

p: Ali is tall. q: Abu is thin.

pq:

Eg 9: Let P: I am rich; Q: I am happy. Write the following compound statements in symbolic forms.
Suppose the truth value of P is F, and Q is T, determine the truth values of the statements.

a) I am rich and happy. PQ FT=F

b) I am poor but happy.

c) I am not rich or not happy. ~P  ~Q ~F  ~T = T  F = T

d) If I am happy then I am not poor. QP

e) It is not true that if I am poor, then I am not happy. ~(~P  ~Q)

3
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

f) I am not happy if and only if I am poor. ~Q  ~P

g) I am happy if I am rich. PQ

Eg 10: For each of the symbolic expression, write the corresponding compound statement base on the
given primary statements:

P: Men are immortal.

Q: Men are safe from tragedy.
R: Men are created by God.
a) P  Q
If men are immortal, then men are safe from tragedy.

b) P  (Q  R)

c) Q  ~ R
Men are safe from tragedy if and only if men are not created by God.

d) ~Q  R
Men are not safe from tragedy or men are created by God.

Can watch this: https://www.youtube.com/watch?v=itrXYg41-V0

Exercise 5.1
1. Determine whether each of the following sentences is a statement. If it is a statement, determine its
truth value.

a) x + 3 is a positive integer.
b) If only every morning could be as sunny as this one!
c) Fifteen is an even number.
d) If Jennifer is late for the party, then her cousin Zachary will be quite angry.
e) What time is it?

2. Let P be “He is intelligent” and Q be “He is kind”. Write each of the following statements in
symbolic form using P and Q and determine its truth value. Assume that both P and Q are true.

a) He is intelligent and kind.

b) He is intelligent, or he is unintelligent and kind.
c) It is not true that he in unintelligent or not kind.
d) He is kind if and only if he is unintelligent.

3. Determine the truth values of each of the following statements.

a) If 5 < 3, then –3 < -5.
b) It is not true that 2 + 2 = 4 or 3 + 5 = 6.
c) It is true that 2 + 2  4 and 3 + 3 = 6.
d) If 2 + 2 = 4, then it is not true that 3 + 3 = 7 if and only if 1 + 1 = 2.

4
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

5.2 Truth Values

We can use truth table to determine the truth value of a compound statement in general.

Tautology: A proposition that is always true whatever the truth values of the component statements.
The last column of the truth table consists of T only.

Example: p  ~ p (2) (1)

p p  ~p
T T F
F T T

Contradiction: A proposition that is always false whatever the truth values of the component
statements. The last column of the truth table consists of F only.

Example: p  ~ p
(2) (1)
p p  ~p
T F F
F F T

Contingency: A proposition that can be either true (T) or false (F), depending on the truth values of its
component statements.

Example: p  ~q
(2) (1)
p q p  ~q
T T F F
T F T T
F T F F
F F F T

The order of evaluating the truth value of an expression is ( ), ~, , , , .

Eg 1: Verify if the followings are tautology, contradiction or contingency.

a) ~(P  Q)  P b) P  ~ (P  Q) c) ~(P  Q)  P
(2) (1) (3) (3) (2) (1) (2) (1) (3)
P Q ~(P  Q)  P P  ~ (P  Q) ~(P  Q)  P
T T F T T F F T F T T
T F T F T F F T T F T
F T T F F F F T F T T
F F T F F F T F F T T
CONTINGENCY CONTRADICTION TAUTOLOGY

5
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Eg 2: Construct the truth table of (a) ~(P  (Q  ~P)) and (b) ~((P  Q)  (~P  ~Q)).
4 3 2 1 6 1 5 2 4 3
P Q ~ (P  (Q  ~P)) ~ ((P  Q)  (~P  ~Q))
T T T T F F F F
T F F T T F T T
F T F T T T T F
F F T F F T T T

Eg. 3: Show that (P  Q)  (Q  R)  (P  R) is a tautology.

1 3 2 5 4
P Q R (P  Q)  (Q  R)  (P  R)
T T T T
T T F T
T F T F
T F F F
F T T T
F T F T
F F T T
F F F T

Exercise 5.2
1. Construct a truth table for each of the following compound statements, where P, Q, R are primitive
statements. Hence, determine the truth value of each statement.
a) ~(P  ~Q)  ~P b) Q  (~P  ~Q) c) (P  Q)  (Q  P)
d) [P  (P  Q)]  Q e) P  (Q  ~P)

2. By using truth table, determine whether each of the following statements is a tautology, contingency
or contradiction.
a) (P~P)Q b) (P~Q)Q
c) [(PQ)(Q ~P)]  P

3. Determine the truth value of each of the following statements by constructing a truth table.
a) (PQ)(PR) b) (PR)(QR)
c) ~R(PQ) d) (PQ)(QR)

4. Verify that [P(QR)][(PQ)(PR)] is a tautology by constructing a truth table.

6
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

5.3 Equivalence
Logical Equivalence (if and only if or  or )
Two statements are considered to be logically equivalent if they have the same truth value for any
combination of truth values of their component statements. The last column of their truth tables is
identical. This means the biconditional statement of two logically equivalent statements is a tautology,
i.e., if A  B, then A  B is a tautology. There is cause-effect relationship.

Eg 1: Show that a) P  (Q  R) & (P  Q)  (P  R) and b) P  ~(Q  R) & (P  Q)  ~R are logically

equivalent.
2 1 1 3 2 3 2 1 1 3 2
P Q R a) P  (Q  R) (P  Q)  (P  R) b) P  ~ (Q  R) (P  Q)  ~R
T T T T T T T T
T T F T T T F T
T F T T T F T F
T F F F F F F F
F T T F T F F F
F T F F T F F F
F F T F T F F F
F F F F F F F F

Conditional Propositions (Converse, Inverse, Contrapositive and Conditional Identity)

The converse of P  Q (if P, then Q) is the implication Q  P (if Q, then P). The inverse of P  Q is
the implication ~P  ~Q (if not P, then not Q). The contrapositive of P  Q is the implication
~Q  ~ P (if not Q, then not P). The conditional identity of P  Q is ~P  Q (not P or Q).

Eg 2: Compare the truth values of P  Q with the truth values of its converse, inverse, contrapositive
and ~P  Q.

P Q PQ QP ~P  ~Q ~Q  ~ P ~P  Q
T T T T T T F T
T F F T T F F F
F T T F F T T T
F F T T T T T T

Eg 3: Give the converse, inverse and the contrapositive of the implication a) “If it is raining, then I get
wet.” and b) “If it is hot and windy, then I go swimming.”
a) Conv: If I get wet, then it is raining.
Inv: If it is not raining, then I don’t get wet.
Contra +tive: If I don’t get wet, then it is not raining.

b) Conv: If I go swimming, then it is hot and windy.

Inv: If it is not hot or not windy, then I don’t go swimming.
Contra +tive: If I don’t go swimming, then it is not hot or not windy.

7
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

If, Only if
A if and only if B is logically equivalent to: A if B and A only if B.

A if B means If B, then A, denoted B  A.

A only if B means If not B, then not A, which is equivalent to its contrapositive: If A, then B,
denoted A  B.

So, A if B is equivalent to “B is a sufficient condition for A”, and A only if B is equivalent to “B is a

necessary condition for A”.

Eg 4: Write the following statement in if-then form.

a) John will break the world’s record for the mile run only if he runs the mile in under 4 minutes.
b) Mary’s birth on U.S. soil is a sufficient condition for her to be a U.S. citizen.
c) George’s attaining age 35 is a necessary condition for his being president of U.S.

a) If John breaks the world’s record for the mile run, then he has run the mile in under 4 minutes.
b) If Mary was born on US soil, then she is a US citizen.
c) If George is US president, then he has attained age 35.

Exercise 5.3
1. For each of the following statements, determine all the primitive statements using p,q,r,… and then
write the inverse, converse and contrapositive in symbolic form and in sentence.
a) If it is raining today, then I will not be playing football.
b) If I am happy, then I will not be alone.
c) If John is tall and thin, then he will be playing basketball.
d) Mary will fail MAT110 if she is lazy or doesn’t attend all the lectures. If P or not Q, then R.
e) I will attend the dinner only if you are not going.
If I attend the dinner, then you are not going. P: I attend the dinner Q: you are going
P  ~Q
Conv: ~Q  P If you are not going, then I attend the dinner.
Inv: ~P  Q If I don’t attend the dinner, then you are going.
Contra: Q  ~P If you are going, then I don’t attend the dinner.

a) P: It is raining today Q: I will play football P ~Q

Inv: ~ P  Q : If it is not raining today, then I will play football.
Conv: ~Q  P : If I don’t play football, then it is raining today.
Contra+tive: Q  ~P : If I play football, then it is not raining today.

c)P : John is tall Q: John is thin R: John will play basketball

(P  Q)  R
Contra: ~R  (~P  ~Q) If John doesn’t play basketball, then he is not tall or not thin.
Conv: R  (P  Q) If John play basketball, then he is tall and thin.
Inv: (~P  ~Q)  ~R If John is not tall or not thin, then he will not play basketball.

8
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

d) P: Mary is lazy Q: Mary attends all the lectures R: Mary fails MAT110
(P  ~ Q)  R
Conv: R  (P  ~ Q) : If May fails MAT110, then she is lazy or doesn’t attend all the lectures.
Inv: ~(P  ~ Q)  ~R equiv to (~P  Q)  ~R
If Mary is not lazy and attends all the lectures, then Mary will not fail MAT110.
Contra+: ~R  (~P  Q)
If Mary does not fail MAT110, then she is not lazy and attends all the lectures.

2. Prove the following logical equivalences by using truth table.

a) P(PQ)  T b) P[P(PQ)]  P
c) ~[~(PQ)P]  ~(PQ)

3. Prove by constructing truth table.

a) P(QR)  (PQ)(PR) b) [(PQ)R]  [(PR)(QR)]
c) [P(QR)]  [~R(PQ)] d) (PQ)RP(QR)(P~Q)(QR)

5.4 Laws of Logic

Here are some important equivalence and their names.
PTP PFP Identity Laws
PTT PFF Domination Laws
PPP PPP Idempotent Laws
~(~P)  P Double Negation Law
PQQP PQQP Commutative Laws
P  (Q  R)  (P  Q)  R P  (Q  R)  (P  Q)  R Associative Laws
P  (Q  R)  (P  Q)  (P  R) Distributive Laws
P  (Q  R)  (P  Q)  (P  R)
~( P  Q)  ~P  ~Q ~( P  Q)  ~P  ~Q De Morgan’s Law
P  (P  Q)  P Absorption Laws
P  (P  Q)  P
P  Q  ~P  Q Conditional Identity
P  Q  ~ Q  ~P Contrapositive
P  ~P  F P  ~P  T Inverse

Eg 1: Show that ~(P  (~P  Q)) and ~P  ~Q are logically equivalent using truth table and laws of
logic.
4 3 1 2 1 3 2

9
 MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

P Q ~(P  (~P  Q)) ~P  ~Q ~(P  (~P  Q))

= ~( (P  ~P)  (P  Q) ) - Dist.
= ~( T  (P  Q)) - Inv.
= ~ (P  Q) - Iden.
= ~P  ~Q - DM

Eg 2: Show that (P  Q)  (P  Q) is a tautology using laws of logic and truth table.

1 3 2
P Q (P  Q)  (P  Q) (P  Q)  (P  Q)
= ~(P  Q)  (P  Q) - Cond. Ident.
= (~P  ~Q)  (P  Q) - DM
= (~P  P)  (~Q  Q) - Assoc.
=T - Inv.

Eg 3: Simplify the following expressions.

a) (P  Q)  ~(~P  Q) b) ~[~[(P  Q)  R]  ~Q] c) (P  Q)  (P  ~Q)
b) ~[~[(P  Q)  R]  ~Q] = =
c) (P  Q)  (P  ~Q)
a) (P  Q)  ~(~P  Q)
= (P  Q)  (~~P  ~Q) - DM
= (P  Q)  (P  ~Q) - DNeg.
= ((P  Q)  P)  ~Q - Assoc.
= P  ~Q - Abs.

Switching Networks
Logical expressions can be used to represent switching networks from a terminal A to terminal B.
Parallel switches are combined using disjunction,  and serial switches are combined using conjunction,
.

P
A B A P Q B
Q

PQ PQ

Eg 4: Give the expression that represents the following switching networks.

a) P b) ~P R
~R
R ~Q

Eg 5: Draw the switching networks for the following logical expressions.

a) (P  Q)  (R  S)
b) (P  Q)  ((P  Q)  R)

P Q
10
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Eg 6: Draw the switching network for the logical expression

((P  R)  ~R)  ((~P  ~Q)  P).
Simplify the expression using laws of logic.

P ((P  R)  ~R)  ((~P  ~Q)  P)

=
~R
R

~P
P

~Q

Can watch this: https://www.youtube.com/watch?v=eihhu72YdpQ

Exercise 5.4
1. Simplify the following compound statements by using laws of logic.
a) (p  q)  (p  q) b) (a  b)  (~ (~a  b))
c) ((~p  q)  ~p)  ((~p  q)  ~q)

11
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

2. Prove the following logical equivalences by using laws of logic.

a) P  (P  Q)  T b) P  [P  (P  Q)]  P
c) ~[~(P  Q)  P]  ~P  ~Q

a) Given an expression [~(a  b)  ~(c  b)]  b.

i) Draw a circuit network for the expression.
ii) Simplify the expression using laws of logic. State the steps and name of laws used.
(7 marks)

12
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

3. Prove the following logical equivalences by using laws of logic.

a) P  (Q  R)  (P  Q)  (P  R)
b) [(P  Q)  R]  [(P  R)  (Q  R)]
c) [P  (Q  R)]  [~R  (P  Q)]
d) (P  Q) R  P  (Q  R)  (P  ~Q)  (Q  R)

4. Consider the following network circuits.

a) Give a logical expression that represents the circuit.
b) Simplify the expression by using laws of logic.
c) Draw the circuit using the simplified expression in (b).

(i) P ii) P ~Q
Q A B
A Q B ~Q R
R
Q
P
R

13
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

5.5 Arguments
Defn: A statement P logically (or tautologically) implies Q iff P  Q is a tautology, denoted by P  Q.

Eg 0: Recall that ((P  Q)  (Q  R))  (P  R) is a tautology. So, ((P  Q)  (Q  R))  (P  R)

& we say (P  Q)  (Q  R) logically implies (P  R).

Eg 1: Show that ((P  Q)  ~Q) logically implies ~P.

1 3 2 5 4
P Q ((P  Q)  ~Q)  ~P
T T T F F T F
T F F F T T F
F T T F F T T
F F T T T T T
Tautology. So, ((P  Q)  ~Q) logically implies ~P.

Arguments: A sequence of statements (premise) of the form (H1  H2  …  Hn)  K. H1, H2, … , Hn
are called the hypotheses (or premises) and K is the conclusion of the argument. A valid argument is an
argument whereby if the hypotheses are true, then the conclusion is also true, i.e. (H1  H2  …  Hn) 
K is a tautology.

Eg 2: Determine if the following argument form is valid or invalid.

a) P  R b) Q  ~R
~R PQ
P  Q P  R
a) 1 3 2 5 4
P Q R (( P  R )  ~R)  (P  Q)
T T T T F F T T
T T F T T T T T
T F T T F F T T
T F F T T T T T
F T T T F F T T
F T F F F T T T
F F T T F F T F
F F F F F T T F
(TAUTOLOGY) => ARGUMENT IS VALID

b) 2 1 4 3 6 5
P Q R ((Q  ~R)  (P  Q))  (P  R)
T T T TF T T T T
T T F TT T T F F
T F T FF T F T T
T F F TT F F T F
F T T TF T T T T
F T F TT T T T T
F F T FF T T T T
F F F TT T T T T
(CONTINGENCY) => ARGUMENT INVALID

14
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

5.6 Rules of Inference

PQ Modus Ponens
P (method of
Q affirming)
PQ Modus Tollens
~Q (method of
~P denying)
PQ Syllogism
QR
P  R
PQ Disjunctive
~P Syllogism
Q
~P  Contradiction Contradiction
P
P Addition
PQ
PR Prove by case
QR
(P  Q)  R
PQ Dilemma
PR
QR
R
PQ Simplification
P
P Conjunction
Q
P  Q

Can watch this: https://www.youtube.com/watch?v=8DW0K3mnc-0

Eg 3: Prove that the following argument is valid.

a) P  Q b) P  Q c) P  R
PR QR ~P  Q
Q  R P  R QS
~R  S
H1: P  Q H1: P  Q H1: P  R
H2: P  R H2: Q  R H2: ~P  Q
1) P -- H1, Simp. 1) ~P  Q -- H1, Cond Iden. H3: Q  S
2) R -- H2 & 1), MP 2) ~P  R -- 1) & H2, Syllog. 1) ~P  S -- H2 & H3, Syllog.
3) Q -- H1, Simp. 3) ~(~P)  R -- 2), Cond Iden. 2) ~R  ~P -- H1, Contra Pos.
4) Q  R -- 3) & 2) Conj. 4) P  R -- 3), Double Neg 3) ~R  S -- 2) & 1), Syllog.

15
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Eg 4: Given the following argument:

“If all computers are attacked by a virus, then a lot of businesses collapse. If a lot of businesses
collapse, then share prices fall. All computers are attacked by a virus and a lot of businesses
collapse. Therefore, share prices fall.”

a) Write the three primary propositions using the variables p, q and r.

b) Write all the hypotheses and the conclusion using the variables in (a).
c) Show that the above argument is valid using the rules of inference.

a) p: all computers are attacked by a virus

q: a lot of businesses collapse
r: share prices fall

b) H1: p  q
H2: q  r
H3: p  q
K: r

c) 1) p  r -- H1 & H2, Syllog.

2) p -- H3, simplification
3) r -- 1) & 2), Modus Ponens

If Sally is not sick then she will exercise. If she is sick then she will stay at home. If she stays at home,
then she will go to sleep. Sally does not go to sleep.
i) Declare the primitive propositions using symbols p, q, r and s.
ii) Write the premises of the argument using those symbols.
iii) Find the conclusion of the argument using the rules of inference

If Ally is well behaved then his mother will give him a reward.
Write the contrapositive of the above statement in both symbols and words.

16
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Can watch this: https://www.youtube.com/watch?v=5RIc_uNEUaY

H1: (~P V Q)  R
H2: R  (S V T)
H3: ~S  ~W
H4: ~W  ~T
K: P

1) ~W - H3, SIMPLIFICATION
2) ~T - 1) & H4, M.P.
3) ~S - H3, SIMPLIFICATION
4) ~S  ~T - 3) & 2), CONJUNCTION
5) ~(S V T) - 4), DeMorgan
6) ~R H2 & 5), MT
7) ~(~P V Q) H2 & 6), MT
8) ~~P  ~Q 7), DeMorgan
9) P  ~Q 8), DOUBLE NEGATION
10) P 9), SIMPLIFICATION

17
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

Exercise 5.5 & 5.6

1. Use truth table to prove that:

a) (~Q(PQ))  ~P b) (RS)(RT)  ~S  ~R

2. Determine the validity of the following arguments using truth table.

a) H1: P  Q b) H1: ~P
H2: ~Q H2: PQ
 P ~(PR)
3. Use rules of inference, prove that the following arguments are valid.
a) m  s b) (pq)  s c) p  q
~p  m ~p  ~s pr
p  s qp qs
s  r

4. Consider the argument below.

If Mary gets the supervisor’s position and works hard, then she will get promotion.
If she gets the promotion, then she will buy a new car.
She has not purchased a new car.
Therefore, Mary didn’t get the supervisor’s position or she didn’t work hard.

a) Use variables p, q, r, s to represent the four primitive statements given in the argument above.
b) Rewrite the argument in symbolic form.
c) Use rules of inference to establish the validity of the argument.

18
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

5. “If today is Monday, then I have Mathematics or a Programming lecture. If the mathematics lecturer
is sick, then the lecture is cancelled. Today is Monday and the Mathematics lecturer is sick.”

a) Use p, q, r and s to represent the four primary statements given in the argument above.
b) Write down the three hypotheses.
c) Use the rule of inference to establish a conclusion from (b) above.

6. Given the following arguments:

“If we go to Langkawi, then we can go shopping. If we go shopping, then we have to spend extra
money. We do not want to spend extra money.”

a) Write the primary propositions by using p, q and r.

b) Write all down all the three premises.
c) Determine the conclusion using the rules of inference.

19
MAT 110/210 CHAPTER 5 FUNDAMENTALS OF LOGIC

20