Professional Documents
Culture Documents
(a) 1 + 1 = 0.
(b) The chalkboard is black.
5. Let t be a tautology and p an arbitrary proposition. Give the truth value of each propo-
sition.
(a) ∼ p ∨ t
(b) ∼ p∧ ∼ t
(c) ∼ (∼ p∧ ∼ t)
(a) (p ∨ q) ∨ (∼ q)
(b) ∼ (∼ p ∨ q)
(c) p ∧ (q ∧ r)
1
(b) If London is in France, then Paris is in England.
10. (In continuation to the example) At the bus stop, Ellen noticed signs for three buses, B1,
B2, and B3, and approached another trio of women, F, G, and H. A conversation ensued:
Ellen: Where do the buses go?
F: At least one of B1 and B2 goes to the capital.
G: B1 goes to the capital.
H: B2 and B3 go to the capital.
F: B3 goes to the beach.
G: B2 and B3 go to the beach.
H: B1 goes to the beach.
Which bus did Ellen take?
11. At the bus terminal, Ellen overheard the following conversation between two baseball fans,
L and M:
L: I like the Yankees.
M: You do not like the Yankees. You like the Dodgers.
L: We both like the Dodgers.
Does fan L like the Yankees? Who likes the Dodgers?
12. After reaching the bus terminal at the capital, Ellen saw three personal computers. She
asked a young woman, I, whether the computers had Internet connections. She replied,
“Computer 1 is not connected to the Internet. Ask that man, J; he is a knight.” When
Ellen approached the man, he told her, “Computer 2 has an Internet connection, but
computer 3 does not.” A second man, K, who overheard the conversation, then said,
“If computer 2 has an Internet connection, then so does computer 1. Computer 3 is not
connected to the Internet.” Which computer had an Internet connection?
(a) (p ∨ q) → r ≡ (p → r) ∨ (q → r)
(b) p → (q ∨ r) ≡ (p∧ ∼ q) → r
(c) p → q ≡ (p∧ ∼ q) → f
14. The logical operators NAND (not and) and NOR (not or) are defined as follows:
p NAND q ≡ ∼ (p ∧ q)
p NOR q ≡ ∼ (p ∨ q)
Construct a truth table for the propositions: p NAND q and p NOR q.
2
15. The Sheffer stroke | is a binary operator defined by the following truth table.
p q p|q
T T F
F T T
T F T
F F T
(a) ∼ p ≡ p|p
(b) p|q ≡∼ (p ∧ q)
(c) p → q ≡ ((p|p)|(p|p))|(q|q)
16. A third useful quantifier is the uniqueness quantifier ∃!. The proposition (∃! x) P (x) means
‘There exists a unique’ (meaning exactly one) x such that P (x). Determine the truth value
of each proposition, where UD = set of integers.
18. Let P (x) : x2 > x, Q(x) : x2 = x, and the UD = set of integers. Determine the truth
value of each proposition.
19. Determine if each implication is vacuously true for the indicated value of n.
(a) If n ≥ 1, then 2n ≥ n; n = 0
(b) If n ≥ 4, then 2n ≥ n2 ; n = 0, 1, 2, 3
3
21. Prove each using the law of the contrapositive.
24. Prime numbers of the form f (n) = 2n − 1, where n is a positive integer, are called
Mersenne primes, after the Franciscan monk Marin Mersenne (1588–1648). For example,
f (2) = 3, f (3) = 7, and f (5) = 31 are Mersenne primes. Give a counterexample to
disprove the claim that if n is a prime, then 2n − 1 is a prime.
26. Give a counterexample to disprove each statement, where P(x) denotes an arbitrary pred-
icate.