Worksheet #2
Worksheet #2
1. Paula has baseball practice every Friday and Saturday, so her statement “I play baseball ev-
ery Friday” is true. Rephrase this as a conditional statement. State the converse and the
contrapositive, and find their truth values.
Solution: “If today is Friday, then I play baseball.” The converse is “If I play baseball,
then today is Friday,” which is false since Paula also plays on Saturday. The contrapositive
is “If I don’t play baseball today, then today isn’t Friday,” which is true; the contrapositive
is logically equivalent to the original statement so it has the same truth value.
2. Let A represent “6 is an even integer” and B represents “4 divides 6.” Express each of the
following compound propositions in an ordinary English sentence, and then determine its truth
value.
(a) A ∧ B
(b) A ∨ B
(c) ¬A
(d) ¬B
(e) ¬(A ∧ B)
(f) ¬(A ∨ B)
(g) A ⇒ B
Solution: Notice that A is true and B is false. Translating each statement to English
gives
1
(g) “If 6 is an even integer, then 4 divides 6,” a conditional statement with a true hy-
pothesis but a false conclusion, which is false.
Solution: “If n and m are even numbers, then n + m is even.” In the first worksheet, we
conjectured that this is true, after trying several cases. It is in fact true (we’ll prove it
next week sometime), so for now let’s accept that it is. The converse is “If n + m is even,
then n and m are even.” This is demonstrably false; 1 + 1 = 2 is even, but 1 is not even.
4. Prove de Morgan’s first law ¬(A ∧ B) ≡ (¬A) ∨ (¬B) using a truth table.
Solution: To avoid parsing a giant truth table, let’s use two: one for ¬(A ∧ B) and the
other for (¬A) ∨ (¬B). For the first, we have
A B A ∧ B ¬(A ∧ B)
T T T F
T F F T
F T F T
F F F T
(a) Write this as quantified statement, and find its truth value.
(b) Formally negate the quantified statement, translate it back to English, and find its truth
value.
Page 2
Solution:
In English, “there exists an even number not divisible by 4,” such as 2 or 6 for
example, which is true.
Solution:
Solution: Let’s fill in the truth table, building up each part of the statement slowly.
A B A ∧ B ¬B A ⇒ ¬B (A ∧ B) ∧ (A ⇒ ¬B)
T T T F F F
T F F T T F
F T F F T F
F F F T T F
Page 3
Since the statement is false for each T/F combination of A and B, it is a contradiction.
Page 4