Homework 2
Homework 2
Benjamin Harter
March 24, 2024
1 Section 2.1
1. (a) Let S(x) stand for “x is a saint” and F (x, y) stand for “x has forgiven
y”. Then:
(b) Let C(x) stand for “x is in the Calculus class”, D(x) stand for “x is in
the discrete math class”, and S(x, y) stand for “x is smarter than y”. Then:
(c) Let L(x, y) stand for “x likes y” and M (x) stand for “x is Mary”. Then:
(d) Let P (x) stand for “x is a police officer”, J(x) for “x is Jane”, R(x) for
“x is Roger”, and S(x, y) for “x saw y”. Then:
(b) Let M (x) stand for “x has measles”, (Dx) for “x lives in this dorm”,
F (x, y) for “xisf riendswithy”, and Q(x) for “x must quarantine”. Then:
1
∀x∃y∃z[D(y) ∧ D(z) ∧ M (z) ∧ F (x, y) → Q(x)]
(c) Let F (x) stand for “x failed the test”, A(x) for “x got an A on the test”,
S(x) for “x is a student in this class that took this text”, D(x) for “x got a D
on the test”, and T (x, y) for “x will tutor y”. Then:
(d) Let C(x) stand for “x can do it” and J(x) stand for “x is Jones”. Then:
4. (a) All unmarried men are unhappy. (b) z has a child and sister.
2 Section 2.2
1. (a) Let M (x) stand for “x is a math major”, F (x, y) for “x is friends with
y”, and H(x) for “x needs help with homework”. Then the negation can be
expressed as:
Then:
2
(b) Let R(x, y) stand for “x and y are roommates” and D(x, y) for “x dislikes
y”. Then the negation can be expressed as:
Then:
• ¬∃x[(x ∈ A ∨ x ∈ B) → (x ∈ C ∧ x ̸∈ D)])
• ∀x¬[(x ∈ A ∨ x ∈ B) → (x ∈ C ∧ x ̸∈ D)] (quantif iernegationlaw)
• ∀x¬[¬(x ∈ A ∨ x ∈ B) ∨ (x ∈ C ∧ x ̸∈ D)] (conditionallaw)