Question # 1:
a. i) s→r ii) ¬p ∧ (p ∨ ¬q) iii) (r ∧ s) ↔ t iv) t → ((r ∧ s) ∨ ¬p)
b. Converse: “Flight is delayed whenever the assignment is not graded.”
Inverse: “The assignment is graded whenever flight is not delayed.”
Contrapositive: “Flight is not delayed whenever the assignment is graded.”
c.
d. = (¬s → ¬h) ∧ (s → w) ∧ (¬w ∧ s) Law of Contrapositive
= (h → s) ∧ (s → w) ∧ (¬w ∧ s) Hypothetical Syllogism
= (h → w) ∧ (¬w ∧ s) Simplification
= (h → w) ∧ (¬w) Modus Tollens
= ¬h Hence above arguments are valid.
e.
i) Swimming at the New Jersey shore is allowed if and only if sharks have not been spotted near the
shore.
ii) If swimming at the New Jersey shore is allowed then sharks have not been spotted near the shore and
conversely.
iii) Swimming at the New Jersey shore is allowed is necessary and sufficient for sharks to not been spotted
near the shore.
f. The statement is Contingency.
a b c ¬a ¬b ¬c a→b b→c b ∧¬c (((a → b) ∧ (b → c) (a → b) ∧ (b → c)
∧ (b ∧¬c)) ∧ (b ∧¬c) ↔ ¬a
T T T F F F T T F F T
T T F F F T T F T F T
T F T F T F F T F F T
T F F F T T F T F F T
F T T T F F T T F F F
F T F T F T T F T F F
F F T T T F T T F F F
F F F T T T T T F F F
Question # 2:
a. i) There is a student in your university who has not connected with anyone on LinkedIn.
ii) Not every student in your university has connected with everyone on LinkedIn.
b. i) ∀x ∃y (S(x, y) ∧ C(y)) ii) ∀x ∀y ( A(y) -> S(x, y) )
c. i) False ii) ¬pq ¬ T (p, q) = p q p+2q = pq False
d. ∣C∪F∣=∣C∣+∣F∣−∣C∩F∣= 367 + 212 −73 = 506.
Hence, 506 students play at least one game.
e. A × B = {(a,1),(a,2),(a,3),(d,1),(d,2),(d,3),(g,1),(g,2),(g,3)}
|A × B| = 9 → |P(A × B)| = 2^9 = 512
f.