Tutorial Sheet 1 2019dddd
Tutorial Sheet 1 2019dddd
logical thinking
Question 1
Determine whether each of the following sentences is a proposition or not. If it is a proposition,
state whether it is true or false.
c) 19 − 1 = 20 and 42 = 16.
d) 5 = 12 or − 12 > −1.
e) x − 2y = z.
Question 2
When can we say that the given statement is false? (i.e under what condition would the given
statement be false?)
b) Every student in the Sets and Numbers class has a black pen.
d) There are foreign-trained doctors who passed the Medical Council Examination.
Question 3
Form a negation of each of the following statements. (write it in its simplest form)
c) (i) ¬(¬P ) (ii) ¬(¬(¬P )) (iii) ¬(¬(¬(¬P ))) (iv) ¬(¬(¬(¬(¬P ))))
Question 4
Set up a Truth-Table for each proposition below.
a) P ∨ (¬P ) b) Q ∨ (¬P ) c) P ∧ Q
d) P ∧ (¬Q) e) P ∧ (¬P ) f ) ¬(P ∧ (¬Q))
1
Question 5 (some “hidden” logical connectives)
a) Rewrite the statement “2 ≤ 8” as a disjunction so that the hidden connective comes out.
c) Rewrite the statement “ − 3 < 1 ≤ 3” as a conjunction (to bring out the hidden connective).
Question 6
The English word “or” is used in two senses. Sometimes “or” means “exactly one of two alterna-
tives”, and sometimes “at least one of two alternatives”. In logic we use the second meaning for
disjunction and the truth table for P ∨ Q is given in a definition in your notes. Use the symbols
P, Q, ¬, ∧, ∨ to express “or” in the sense of “exactly one of two alternatives”. There are a number
of ways of doing this. Find two ways and compare the Truth-Tables of each to check that they
are “the same”. Why is the last phrase in inverted commas?
Question 7
Use Truth-Tables to determine when the given proposition is true. Give your answer in terms
of combinations of truth-values for P and Q.
a) ¬Q ∧ (¬P ∨ Q)
Question 8
(i) When is it true? (give your answer in terms of combinations of truth values for P and
Q)
(ii) When is it false? (same way)
∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗
∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗