Practice Sheet 1 230
Practice Sheet 1 230
Write these propositions using p and q and logical connectives (including negations
and exclusive OR):
Write these propositions using p, q, and r and logical connectives (including negations).
The campground is open for visitors, but campfires are not allowed.
Campfires are allowed, and the river is safe for swimming, but the campground is
not open for visitors.
If the campground is open, then campfires are allowed if and only if the river is
safe for swimming.
Campfires are not allowed, but the campground is open and the river is safe for
swimming.
For campfires to be allowed, it is necessary and sufficient that the campground be
open and that the river is not safe for swimming.
Campfires are not allowed whenever the campground is open and the river is safe
for swimming.
¬p
p∨q
¬p ∧ q
q→p
¬q → ¬p
¬p → ¬q
p↔q
¬q ∨ (¬p ∧ q)
¬q ↔ r
q→¬r
p∨q∨r
(p → ¬ r) ∨ (q → ¬ r)
(p ∧ q) ∨ (¬ q ∧ r)
(q ∧ r) ↔ (p ⊕ ¬ r)
Q12 Show that, “In the Olympic Games, either the USA will win the gold medal or both
Canada and Australia will win medals” and “The USA will win a medal or Canada will
win a medal, and the USA will win a medal or Australia will win a medal” are
logically equivalent using truth tables.
∃x D(x)
∀x D(x)
∃x ¬D(x)
∀x ¬D(x)
∀x (T(x)→R(x))
∃x (T(x)∧R(x))
∀x (T(x)∧R(x))
∃x (T(x)→R(x))
Q15 Let E(x) represent "x is enrolled in an art class," B(x) means "x is in a beginner's
course," G(x) means "x has a good grade," and S(x) represent "x likes studying." The
domain consists of some students in an art class. Translate each of these statements
into English.
∀x (E(x) → G(x))
∃x (B(x) ∧ S(x))
¬∀x (B(x)→(G(x) ∨ S(x)))
Q16 Translate each of these statements into logical expressions using predicates,
quantifiers, and logical connectives. Let F(x) denote "x is a family member," and K(x)
denote "x is kind."
There is a student at your school who knows how to play an instrument and is a
member of a band.
There is a student at your school who knows how to play an instrument but is not
a member of a band.
Every student at your school either knows how to play an instrument or is a
member of a band.
No student at your school knows how to play an instrument or is a member of a
band.
S(x): x is a student.
P(x): x is a professor.
C(y): y is a course.
¬r
r↔s
¬r⊕s
(r ↔ s) ^ (¬ r ⊕ s)
Q24 State the converse, contrapositive, and inverse of each of these conditional statements.
∃xP(x)
∀xP(x)
∃x¬P(x)
∀x¬P(x)
Q31 Translate these statements into English, where C(x) is “x is a comedian” and F(x) is “x
is funny” and the domain consists of all people.
∀x(C(x) → F(x))
∀x(T(x) → F(x))
∃x(T(x) ∧ A(x)
¬∀x(T(x) → (F(x) ∨ C(x))
No one is perfect.
Not everyone is perfect.
All your friends are perfect.
At least one of your friends is perfect.
Everyone is your friend and is perfect.
Not everybody is your friend or someone is not perfect.
There is a student at your school who can speak English and who knows Python.
There is a student at your school who can speak English but who doesn’t know
Python.
Every student at your school either can speak English or knows Python.
No student at your school can speak English or knows Python.
Q36 Let C(x) means "x is a core course," T(x,y) means "Student y has taken course x," and
G(y) means "Student y has met graduation requirements." The domain consists of all
students and courses. Formulate the following statements using quantifiers:
Q37 Let S(x) mean "x submitted a research paper," R(x,y) mean "Reviewer y read x's
paper," and A(x,y) mean "Reviewer y approved x's paper." The domain consists of all
researchers and reviewers.
Every researcher has at least one reviewer who has read and approved their paper.
There exists a reviewer who has read every paper but has not approved at least
one of them.
For every research paper, if it was read by a reviewer, then there exists another
reviewer who did not read it.
There exists a project manager who can work with everyone on the team who
knows Python.
For every person who knows Python, there is at least one other person they can
work with who is not a project manager.
For every person, if they are a project manager, there exists at least one person on
the team with whom they cannot work.
Describe, using quantifiers, the condition where there exists a job such that only
applicants with both software skills and managerial experience qualify.
Write the condition, using quantifiers, for a job that requires at least one
applicant without software development skills but with managerial experience to
qualify.