Scribd
Upload
15 views1 page

DMS Assignment-1

The document is an assignment consisting of various questions related to logic, including the contrapositive, converse, and inverse of conditional statements, truth tables, tautologies, contradictions, and equivalences. It also includes tasks to rewrite conditional statements in terms of sufficient and necessary conditions, and to express logical operations using the NOR operator. The assignment covers fundamental concepts in propositional logic and requires proofs and truth table constructions.

Uploaded by

arijit.maths
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
15 views1 page

DMS Assignment-1

The document is an assignment consisting of various questions related to logic, including the contrapositive, converse, and inverse of conditional statements, truth tables, tautologies, contradictions, and equivalences. It also includes tasks to rewrite conditional statements in terms of sufficient and necessary conditions, and to express logical operations using the NOR operator. The assignment covers fundamental concepts in propositional logic and requires proofs and truth table constructions.

Uploaded by

arijit.maths
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

Assignment-1

Answer the following ques ons:

1. What are the contrapositive, the converse and the inverse of the conditional statement “The home team
wins whenever it is raining”?
2. For a given conditional statement, which statement is equivalent to it: converse, contrapositive and
inverse? Explain.
3. Out of converse, contrapositive and inverse which two statements are equivalent. Give a proof.
4. Construct a truth table for each of the following:
i)  p  q    q   p 
i i )  p  q   q  p 
iii)  p  q    p   q 
i v )  p   q   q  r 
v )  p  q   r  s 
5. Show that: pp is a tautology.
6. Show that: pp is a contradiction.
7. Prove that ppp is a tautology.
8. Prove that (𝑝𝑞) (𝑝 → 𝑞)  (𝑞 → 𝑝) is a tautology.
9. Prove that “If the sky is cloudy then it will rain and it will not rain” is a contradiction.
10. Show that [(𝑝 → 𝑞) 𝑞] ↔ 𝑝 is a tautology.
11. Show that pq and (𝑝 → 𝑞)  (𝑞 → 𝑝) are equivalent.
12. Using truth table prove the following:
i ) p   q  r   q   p  r 
ii )  p  q    p  q 
iii )  p  q    p  r    q  r  is a tautology.
iv )   p  q    p  q 
v )   p  q    p  q 
13. There are two hotels. One says “Good food is not cheap” and the other says “Cheap food is not good”.
Are they saying the same thing?
14. Verify that the two propositions ((𝑝𝑞) (𝑝𝑟)) → 𝑠 and (p(qr)) s are equivalent.
15. Rewrite the conditional statement “If you get 100% in the final exam, you get A grade” in two ways by
showing: 1) Sufficient condition and 2) Necessary condition.
16. Rewrite the conditional statement “If you show up on Monday, you will get the job” in two ways by
showing: 1) Sufficient condition and 2) Necessary condition.
17. “You walk 8 miles is necessary to get to the top”. Rewrite the statement to its equivalent form.
18. The Pierce arrow (NOR operator-↓) is logical binary operator, defined as follows: 𝑃 ↓ 𝑄 ≡ ~(𝑃 𝑉 𝑄).
a) Write ~𝑃, 𝑃 ∧ 𝑄 and 𝑃 𝑉 𝑄 in terms of the NOR operator alone.
b) Write 𝑃 𝑉 (𝑄∧ R) in terms of the NOR operator alone.

You might also like