tutorial2_qns
tutorial2_qns
Tutorial 2
Logic of Quantified Statements
1 Discussion questions
Discussion questions are meant for discussion on the IVLE Forum. You may try them on your own or
discuss them with your classmates. No answers will be provided by us.
D1. Using the following English sentence, explain why English can be ambiguous.
“Every boy loves a girl.”
Interpret the above sentence in two ways and write the logical statement for each of them.
D2. Let the domain of discourse D be the set of all students at your school, and let M (s) be “s is a
math major”, let C(s) be “s is a computer science student”, and let E(s) be “s is an engineering
student”. Express each of the following statements using quantifiers, variables, and the predicates
M (s), C(s), and E(s).
Part (a) has been done for you.
a. Every computer science student is an engineering student.
Answer: ∀s ∈ D (C(s) → E(s)).
Discuss: Why is the following answer wrong? Can you also give an example to show the
difference between this incorrect answer and the above answer?
Incorrect answer: ∀s ∈ D (C(s) ∧ E(s)).
b. No computer science students are engineering students.
c. Some computer science students are not math majors.
d. If a student is not a math major, then he or she is either a computer science student or an
engineering student, but not both.
D3. The following table shows when the quantified statements are true and when they are false.
Statement True when... False when...
∀xP (x) P (x) is true for every x. There is an x for which P (x) is false.
∃xP (x) There is an x for which P (x) is true. P (x) is false for every x.
2 Additional Notes
We picked up some frequently asked questions from students in the past semesters and created this
Additional Notes section to include some materials not covered in lecture that might be of interest to
you.
Page 1
CS1231 (AY2018/19 Sem1)
Scope of quantifiers
• When a quantifier is used on a variable x in a predicate statement, we say that x is bound. If
no quantifier is used on a variable, we say that the variable is free.
Examples: In the statement ∀x∃y P (x, y), both x and y are bound. In the statement ∀x P (x, y),
x is bound but y is free.
• A statement is called a well-formed formula (or wff ) when all variables are properly quantified.
• The set of all variables bound by a common quantifier is the scope of that quantifier.
If there are no parentheses, then the scope is the smallest wff following the quantification.
Example: For ∀x(∃y P (x, y) ∨ Q(x, y)), x and y in P (x, y) are bound, while y in Q(x, y) is free,
because the scope of ∃y is P (x, y). The scope of ∀x is (∃y P (x, y) ∨ Q(x, y)).
3 Tutorial questions
Q1. For each of the following statements write the converse, inverse, and contrapositive. Indicate
which among the statement, its converse, its inverse, and its contrapositive are true and which are
false. Give a counterexample for each that is false.
a. ∀n ∈ Z+ , if n is prime then n is odd or n = 2.
b. ∀n ∈ Z, if (6 | n), then (2 | n) and (3 | n).
c. ∀a, b, c ∈ Z, if a − b is even and a − c is even, then b − c is even.
Q2. Prove the statement in Question 1c:
∀ a, b, c ∈ Z, if a − b is even and a − c is even, then b − c is even.
Q3. Let V be the set of all visitors to Universal Studios Singapore on a certain day, T (v) be “v took
the Transformers ride”, G(v) be “v took the Battlestar Galactica ride”, E(v) be “v visited the
Ancient Egypt”, and W (v) be “v watched the Water World show”.
Express each of the following statements using quantifiers, variables, and the predicates T (v), G(v),
E(v) and W (v). The statements are not related to one another.
a. Every visitor watched the Water World show.
b. Every visitor who took the Battlestar Galactica ride also took the Transformers ride.
c. There is a visitor who took both the Transformers ride and the Battlestar Galactica ride.
d. No visitor who visited the Ancient Egypt watched the Water World show.
e. Some visitors who took the Transformers ride also visited the Ancient Egypt but some did not
(visit the Ancient Egypt).
Q4. Refer to Figure 3.3.2 (in page 120 of Susanna Epp’s book and also on slide 52 of lecture slides
“The Logic of Quantified Statements”). Determine whether each of the following statements is true
or false.
a. ∀ students S, ∃ a dessert D such that S chose D.
b. ∀ students S, ∃ a salad T such that S chose T .
c. ∃ a beverage B such that ∀ students S, S chose B.
d. ∃ an item I such that ∀ S, S did not choose I.
e. ∃ a station Z such that ∀ students S, ∃ an item I such that S chose I from Z.
Page 2
CS1231 (AY2018/19 Sem1)
Q5. Some of the arguments below are valid by universal modus ponens or universal modus tollens;
others are invalid and exhibit the converse error or the inverse error. State which are valid and
which are invalid. Justify your answers.
a. If a person likes coffee, he likes toffee.
Jack does not like toffee.
∴ Jack does not like coffee.
b. All positive odd integers greater than 1 are primes.
4 is not a positive odd integer greater than 1.
∴ 4 is not a prime.
c. Anyone above 18 and passed the driving test gets a driving licence.
Sharon gets a driving licence.
∴ Sharon is above 18 and passed the driving test.
Q6. Indicate which of the following statements are true and which are false. Justify your answers.
a. ∀a ∈ Z, ∃b ∈ Z such that a + b = 0. (AY2015/6 Sem2 Midterm test)
b. ∃a ∈ Z such that ∀b ∈ Z, a + b = 0. (AY2015/6 Sem2 Midterm test)
c. ∀x ∈ R+ , ∃y ∈ R+ such that their arithmetic mean is equal to their geometric mean.
Page 3