1

CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

UNIT II LOGIC AND LOGIC PROGRAMMING
Assignment I PROPOSITIONAL LOGIC
1. Translate the following English sentence to
propositional logic form.
i. If either Ram takes C++ or Kumar takes Pascal, then Latha
will take Lotus.
ii. a. If it is raining then there are clouds in the sky.
b. If it is not raining, then the sun is not shining and there
are clouds in the sky.
c. The sun is shining if and only if it is not raining.

iii. a. If the moon is out and it is not snowing, then Ram goes
out for a walk.
b. If the moon is out, then if it is snowing, Ram goes out for
a walk.
c. It is not the case that Ram goes out for a walk if and only
if it is not snowing or moon is out.

iv. a. If the sun is shining, I shall play tennis in the afternoon.
b. Finishing the writing of my computer program before
lunch is necessary for playing tennis in this afternoon.
c. Low boundary and sunshine are sufficient to ply tennis
in this afternoon.

2. Show that following propositional statements are
logically equivalent.
i. (pv(p.q)) and p.q
ii. (p q)r and p (q r)
iii. (p q) and p q
iv. (pq).(pr) and p(q.r)
v. (p q) and (p q)

3. Show that p(q v r ) r (p q) (p.q )r
4. Prove the following tautological implication.

i. P(QR) (PQ)(PR)
ii. ((pvq).(pvr))(qvr)
iii. p.(pq)q
iv. q.(pq)p
v. ((pq).(qr))(pr)
vi. ((pvq).(p))q

5. Represent the following propositional statements in
functionally complete set of connectives form.

i. (P(Q.R))
ii. (P Q).(PQ)

6. The NAND connective | is defined as a | b (a.b)
where stands for equivalent to. Check whether
following propositional logic is logically equivalent.
i. (a|b) (b|a)
ii. (a|b)|c a|(b|c)
iii. (a.b)|c a|(b.c)
iv. (a|b)c (a.b)vc