Scribd
Upload
11 views1 page

Assignment 1

The document is an assignment for a Discrete Structure course at Gautam Buddha University, detailing various questions related to propositional logic, truth tables, logical equivalence, and predicate logic. It includes tasks such as expressing propositions in English, proving tautologies, and determining the validity of conclusions based on given premises. The assignment is due on February 16, 2026.

Uploaded by

Divine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

Assignment 1

The document is an assignment for a Discrete Structure course at Gautam Buddha University, detailing various questions related to propositional logic, truth tables, logical equivalence, and predicate logic. It includes tasks such as expressing propositions in English, proving tautologies, and determining the validity of conclusions based on given premises. The assignment is due on February 16, 2026.

Uploaded by

Divine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

GAUTAM BUDDHA UNIVERSITY

Assignment:01
Course Name: Discrete Structure Course Code: CS212
Last Date of Submission: 16/02/2026 Unit: 01

Q1. Let p, q, and r be the propositions


p: You have the flu.
q: You miss the final examination.
r: You pass the course.
Express each of these propositions as an English sentence.
a) p → q b) ¬q ↔ r c) q → ¬r d) p ∨ q ∧ r e) (p → ¬r) ∨ (q → ¬r)
Q2. Show that each of these conditional statements is a tautology by using truth tables.
a) [¬p∧(p∨q)] → q b) [(p → q)∧(q → r)] → (p → r)
c) [p∧(p → q)] → q d) [(p ∨q)∧(p → r)∧(q → r)] → r
Q3. Show that ¬p → (q → r) and q → (p∨r) are logically equivalent(using Boolean algebra).
Q4. Show that (p → q) → r and p → (q → r) are not logically equivalent(truth table).
Q5. Determine whether the (p ∨ ¬q) ∧ (¬p ∨ q) ∧ (¬p ∨ ¬q) is satisfiable.
Q6. If p ∨ q = False, r = True, which of the following propositions is/are neither tautology nor contradiction?
(a) (𝑝 ⟶ 𝑞 ) ∧ 𝑟 (b) (𝑝 ⟶ 𝑞 ) ∧ ~𝑟 (c) (~𝑝 ⟶ ~𝑞 ) ∧ ~r
Q7. p(x): x^2 – 8x + 15 = 0
q(x): x is odd
r(x): x > 0
Which of the following is true?
(a) $x[p(x)®q(x)] (b) "x[q(x)®p(x)]
(c) $x[r(x)®p(x)] (d) "x[p(x)®q(x)]
[Link] are the contrapositive, converse and the inverse of the conditional statement “If today is Sunday, then it
is a holiday".
Q9. Prove that the premises 𝑃 ⟶ 𝑄, 𝑄 ⟶ 𝑅, 𝑅 ⟶ 𝑆, 𝑆 ⟶ ¬𝑅 and 𝑃 ∧ 𝑆 are inconsistent.
Q10. P1: If it rains, then match will not be played P2: The match was played
which of the following is valid inference?
(a) It rains (b) It did not rain (c) It either rain or did not rain
Q11. Let 𝐸 = {−1,0,1,2} denote the universe of discourse. If 𝑃(𝑥, 𝑦) = 𝑥 + 𝑦 + 1, find the truth value of
(∀𝑥)(∃𝑦)𝑃(𝑥, 𝑦).
Q12. Premises:
1. If you go to the library regularly then you get good reference books or you can study in a silent
environment.
2. If you get good reference books, then you understand difficult topics easily.
3. If you understand difficult topics easily or you study in a silent environment, then you do not feel stressed
before exams.
4. If you do not feel stressed before exams, then you sleep well in the night before the paper.
5. You go to the library regularly.
Conclusion: You sleep well in the night before the paper. Check whether the conclusion is valid or not using
inference rule.
Q13. Obtain the PDNF and PCNF of (𝑃 ∧ 𝑄) ∨ (¬𝑃 ∧ 𝑅).
[Link] the given english statement into predicate logic.
(a) Some propositions are tautologies.
(b) At least one of your friends is not perfect.
(c) Every bird can fly.
(d) Not all hardworking peoples are rich.

You might also like