DEPARTMENT OF MATHEMATICS

Computer Science and Computer Applications Stream

Discrete Mathematics - University Questions
Unit-II: Mathematical Logic
Section-A: Choose the best answer

1. Which of these sentences is a proposition? (November 2023)

A. 1+7=10 B. There is no pollution in Coimbatore C. When will the exam starts?
D. 10+x=15
Ans: A. 1+7=10

2. p ⇒ (p ⇒ q) is equivalent to (November 2023/ June 2022)

A. p B. p ⇒ q C. q D. q ⇒ p
Ans: B. p ⇒ q

3. If p and q are two statements ...... is true statement when either p or q is true but not both
and vice versa (May 2023)
A. p ↑ q B. p ⇒ q C. p ↓ q D. p ⊕ q
Ans:

4. [(p ⇒ q)∧ ∼ q] is tautologically imply (May 2023)

A. p B. ∼ q C. q D. ∼ p
Ans:

5. If p and q are two statements ...... is true statement when both p and q are false, otherwise
false (December 2022)
A. p ↑ q B. p ⇒ q C. p ↓ q D. q ⇒ p
Ans: B. p ⇒ q
 6. Which of the following is not equivalent? (December 2022)
A. ∼ (p ∧ q) ≡∼ p∨ ∼ q B. ∼ (∼ p ∧ q) ≡ p ∨ q C. ∼ (∼ p∧ ∼ q) ≡∼ p ∨ q
D. ∼ (∼ p∨ ∼ q) ≡ p ∧ q
Ans: C. ∼ (∼ p∧ ∼ q) ≡∼ p ∨ q

7. Which of these sentences is a proposition? (June 2022)

A. 5+7=10 B. There is no pollution in Chennai C. What time is it? D. 4+x=5
Ans: A. 5+7=10

8. Which of the following is a logical statement? (July 2021)

A. A ∩ B B. A ⊆ (A ∪ B) C. φ ∪ A D. {1} ∪ {2, 3, 4}
Ans: B. A ⊆ (A ∪ B)

9. The NAND connective in logic is equivalent to (July 2020)

A. ∼ p∨ ∼ q B. ∼ (p ∨ q) C. ∼ p ∧ q D. ∼ p ∨ q
Ans: A. ∼ p∨ ∼ q

10. Which of the following is a contradiction? (April 2019)

A. p ∨ p B. p ∧ p C. p∧ ∼ p D. p∨ ∼ p
Ans: C. p∧ ∼ p

11. Which of the following is not true? (April 2019)

A. P ∨ T = P B. P ∨ F = P C. P ∧ T = P D. P ∧ F = F
Ans: A. P ∨ T = P

12. Which of the following is a tautology (April 2018)

A. P ∨ P B. P ∧ P C. P ∧ ∼ P D. P ∨ ∼ P
Ans: A. P ∨ P

13. The proposition p ⇒ q is equivalent to (April 2018)

A. q ⇒ p B. ∼ q ⇒∼ p C. ∼ p ⇒∼ q D. None of these
Ans: B. ∼ q ⇒∼ p

14. p ⊕ q is equivalent to (November 2018)

A. p ⇔ q B. ∼ (p ⇔ q) C. ∼ p ⇔∼ q D. ∼ (p ↓ q)
Ans: B. ∼ (p ⇔ q)

Page 2
15. p ⇒ q is equivalent to (December 2020/November 2018)
A. q ⇒ p B. ∼ p ⇒ q C. p ⇒∼ q D. ∼ q ⇒∼ p
Ans: D. ∼ q ⇒∼ p

16. p ↑ q is equivalent to (July 2021/November 2017)

A. p∧ ∼ q B. ∼ p∧ ∼ q C. ∼ p ∧ q D. ∼ (p ∧ q)
Ans: D. ∼ (p ∧ q)

17. Which of the following set is not functionally complete set? (November 2017)
A. {∼, ∨} B. {∼, ∧) C. {∨, ∧} D. {↑}

18. Which of the following is equivalent? (April 2017)

A. ∼ (p ∧ q) ≡∼ p∧ ∼ q B. ∼ (p ∧ q) ≡∼ p∨ ∼ q C. ∼ (p ∨ q) ≡∼ p∨ ∼ q
D. (p ∨ q) ≡∼ (p ∧ q)
Ans: B. ∼ (p ∧ q) ≡∼ p∨ ∼ q

19. Which of the following is not a tautology? (April 2017)

A. p ∧ q ⇒ q B. p ⇒ p ∨ q C. q ⇒ p → q D. ∼ q ⇒ p → q
Ans: D. ∼ q ⇒ p → q

20. Which of the following sentence is a logical statement? (November 2016)

A. 7 + x = 21 B. What is your age? C. Amritha is dancing D. Open the gate.
Ans: A. 7 + x = 21

21. The proposition e(eP ∨eP ) is not equivalent to (November 2016)

A. eP B. P C. P ∧ P D. e(eP )
Ans: C. P ∧ P

Section-B

1. Show that the connective {↓} is commutative but not associative. (November 2023/ May
2023)

2. If q, q and r are three logical statements, then show that [(p ⇒ q) ∧ (q ⇒ r)] ⇒ (p ⇒ r)
(November 2023/ June 2022)

3. If p and q are two logical statements construct truth table for (p ↑ q ↑ r) (May 2023)

Page 3
 4. Show that (P ⇒ Q) ⇒ Q tautologically imply P ∧ Q (December 2022)

5. If p and q are two statements, then show that (p ⊕ q) ∨ (p ↓ q) is equivalent to p ↑ q.

(December 2022)

6. Prove that conditional operation distributive over conjunction. (June 2022)

7. If p and q are two statements, then show that (p ↑ q) ⊕ (p ↑ q) is equivalent to (p ∨ q) ∧ (p ↓ q)

(July 2021/November 2019/2017)

8. Construct the truth table for the following p ⇒ [(p ∨ r)∧ ∼ (p ⇔∼ r)] (December 2020)

9. Prove that ∼ (p ⇔ q) ≡ p ⇔∼ q (April 2019).

10. Using truth table, prove that ∼ (p ∧ q) =∼ p∨ ∼ q (April 2018)

11. Construct the truth table for p ⊕ q ⊕ r (April 2018)

12. Show that {↑} is commutative but not associative. (November 2018)

13. Show that [(p ⇒ q) ∧ (q ⇒ r)] ⇒ (p ⇒ r) (July 2021/ November 2018)

14. Show that p → (q ∨ r) ≡ (p → q) ∨ (p → r) (April 2017)

15. Express p ↓ q interms of ↑ only. (April 2017)

16. Prove that p → (q → r) ≡ (p ∧ q) → r. (November 2016)

17. Show that ∼ (p ↑ q) ≡∼ p ↓∼ q (November 2016)

Section-C

1. If p and q are two statements, then show that (p ↑ q)⊕(p ↑ q) is equivalent to (p∨q)∧(p ↓ q).
(November 2023)

2. Establish ∼ p is the valid conclusion from the arguments ∼ (p ∧ q), r, q ⇒ r. (November

2023)

3. Establish t ∧ s can be derived from the premises (p ⇒ q), q ⇒∼ r, r, p ∨ (t ∧ s) (May 2023)

Page 4
 4. If p and q are two statements, then show that (p ⊕ q) ∨ (p ↓ q) is equivalent to p ↑ q. (May
2023)

5. Show that the premises ”It is not sunny this afternoon and it is colder than yesterday”, ”We
will go swimming only if it is sunny”, ”If we do not go swimming, then we will take a canoe
trip”, and ”If we take a canoe trip, then we will be home by sunset” lead to the conclusion
”we will be home by sunset”. (December 2022)

6. Establish r is the valid conclusion from the arguments p ⇒ q, p ∧ r and ∼ q. (December

2022)

7. Show that ∼ q ∧ (p ⇒ q) tautologically imply ∼ p. (June 2022)

8. Establish ∼ p is the valid conclusion from the arguments ∼ (p∧ ∼ q), ∼ r, q ⇒ r. (June
2022)

9. Prove that p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) (July 2021)

10. Show that S is the valid arguments from the premises R, P ⇒ (Q ⇒ S), ∼ R ∨ P, Q (July
2021)

11. If p and q are two statements, then show that (p ⊕ q) ∨ (p ↓ q) is equivalent to p ↑ q.

(December 2020)

12. Explain universal and Existential quantifier with suitable examples. Also state the properties
of Quantifiers. (December 2020)

13. Prove that p ⇒ (q ∧ r) ≡ (p ⇒ q) ∧ (p ⇒ r) (December 2020/April 2019/April

2018/November 2017)

14. Show that ∼ r ⇒ s follows logically from p ⇒ r, ∼ p ⇒ q and q ⇒ s (April 2019)

15. Express p ↑ q interms of ↓ only (April 2018)

16. Show that p ⇒ (q ⇒ r) ≡ (p ∧ q) ⇒ r (November 2018)

17. Establish s follows from the arguments p ⇒ (q ⇒ s), ∼ r ∨ r, q and r. (November 2018)

18. Establish ∼ p follows from the premises p ⇒ r, r ⇒ s, t∨ ∼ s, ∼ t ∨ u and ∼ u. (November

2017)

Page 5
19. Define universal and existential quantifiers also define the rules of specification and general-
isation in predicate logic. (November 2017)

20. Show that (p ⇒ (q ∧ r)) ⇒∼ (p ⇒ q) is a contingency. (April 2017)

21. Show that p follows from the arguments (∼ p∨ ∼ q) ⇒ (r ∧ s), r ⇒ t and ∼ r (April 2017)

22. Show that ∼ (p ⇔ q) ≡ ((p∧ ∼ q) ∨ (q∧ ∼ p)). (November 2016)

23. Establish ∼ p follows from the arguments p ⇒ r, r ⇒ s, r∨ ∼ s, ∼ t∨u and ∼ u (November

2016)

zzzzz