B.Tech.

CS III Sem
Discrete Mathematical Structures
Assignment 1 (Propositional Logic)

1. Write propositions for the following sentences:

a) If I play football, then I study.
b) Playing football is sufficient for me to study.
c) Playing football is necessary and sufficient for me to study.
d) Playing football is sufficient for me to study.
2. Without constructing truth table show the following equivalences:
a) 𝑝 → 𝑞 ≡ ~𝑞 → ~𝑝
b) (𝑝 → 𝑞) ∧ (𝑝 → 𝑟) ≡ 𝑝 → (𝑞 ∧ 𝑟)
c) (𝑝 → 𝑟) ∧ (𝑞 → 𝑟) ≡ (𝑝 ∨ 𝑞) → 𝑟
3. Without constructing truth table show that following propositions are
tautologies.
a) (𝑝 ∧ 𝑞) → (𝑝 ∨ 𝑞)
b) [~𝑝 ∧ (𝑝 ∨ 𝑞)] → 𝑞
c) [𝑝 ∧ (𝑝 → 𝑞)] → 𝑞
4. Write predicates for the following sentences:
a) All the students in the class have visited library.
b) Some students in the class have not visited the library.
c) No student in the class have visited library.
d) All the students in the class have not visited library.
5. Check the validity of the following argument: “If I go to market, then I buy
sweet. If I go to market, then I feel happy. Therefore, If I go to market, then I
buy sweet and feel happy.”
6. Show that ∀𝑥[𝑃(𝑥) ∨ 𝑄(𝑥)] ⇒ ∀𝑥[𝑃(𝑥)] ∨ ∃𝑥𝑄(𝑥) using indirect method
(method of contraposition).