Assignment 1
Assignment 1
Q1: Use De Morgans’s law to write the negations of the given statements. Also plot the final
solution graphically.
i. 𝑥 ≤ −1 𝑜𝑟 𝑥 > 1
ii. 1 > 𝑥 ≥ −3
Q2: Use truth tables to establish which of the given statement form is a tautology and which is a
contradiction.
i. (𝑝 ⋀ 𝑞) ⋁ (¬𝑝 ⋁ (𝑝 ⋀ ¬𝑞))
ii. ((¬𝑝 ⋀ 𝑞) ⋀(𝑞 ⋀ 𝑟)) ⋀ ¬𝑞
Q4: If statement forms P and Q are logically equivalent, then 𝑷 ↔ 𝑸 is a tautology. Conversely,
if 𝑷 ↔ 𝑸 is a tautology, then P and Q are logically equivalent. Use ↔ to convert each of the
logical equivalences in given below to a tautology. Then use a truth table to verify each
tautology.
i. 𝑝 → (𝑞 ⋁ 𝑟) ≡ (𝑝 ⋀ ¬𝑞) → 𝑟
ii. 𝑝 ⋀ (𝑞 ⋁ 𝑟) ≡ (𝑝 ⋀ 𝑞) ⋁ (𝑝 ⋀ 𝑟)