I don't understand how to do this, please help me. 

 

 

IT 102 Module 2 Homework
I Write each of the following in symbolic form using p = “Sybil
does not play basketball”, q = “Sybil likes singing”, r = “Sybil
wants to take up a career in singing”
1 Sybil plays basketball and it is not the case that she likes
singing. ~p∧~q
2 Sybil wants to take up a career in singing if and only if she
likes singing. (q ↔ r)
3 If Sybil does not play basketball then she does not like
singing. p→~q
4 If Sybil likes singing and she wants to take up a career in
singing, then she plays basketball. (q∧r) → ~p
5 If Sybil likes singing, then she wants to take up a career in
singing but she plays basketball. q→(r∧~ p) II Create Truth Tables for each of the following expressions
1
2
3
4
5
6 q V ~p
(~p∧~q) ∨p
~r→ (p V r)
p ∧ q ↔ ~q
(~p ∨ q) ∧ r
(p ∧ q) →(~p ∨ r) III Label each of the following as Tautology, Contradiction, or
Neither (note: you MUST provide a truth table).
1 (pq) V ~(p ↔q)
2 (pq) V r ↔ (r ∧ p) V q
3 ~p∧(qp) IV Are the following pairs of statements Logically Equivalent (note:
you MUST provide the truth tables)?
1 (p ∧r) q; ~q
2 ~p V ~(q ∧r); (p ∧q) ~r

Attachments:

• 1493885496-IT102Module2Homework.docx