Scribd
Upload
112 views

Q2 - Practice Questions (Predicate Logic)

This document contains practice questions about expressing statements using predicates, quantifiers, and logical connectives. There are multiple sections covering different topics like expressing statements about students and their pets, students communicating via email, students' food preferences, and faculty asking questions. The questions require translating English statements into symbolic logic and vice versa, expressing negations of statements, and determining whether statements are true given different domains.

Uploaded by

Mahad Sohail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
112 views

Q2 - Practice Questions (Predicate Logic)

This document contains practice questions about expressing statements using predicates, quantifiers, and logical connectives. There are multiple sections covering different topics like expressing statements about students and their pets, students communicating via email, students' food preferences, and faculty asking questions. The questions require translating English statements into symbolic logic and vice versa, expressing negations of statements, and determining whether statements are true given different domains.

Uploaded by

Mahad Sohail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Discrete Structures Practice Questions

Let C(x) be the statement “x has a cat”, let No student at your school can speak
D(x) be the statement “x has a dog”, and let Russian or knows C++.
F(x) be the statement “x has a ferret”.
Translate these statements into English,
Express each of these statements in terms
where the domain for each variable
of C(x), D(x), F(x), quantifiers, and logical
consists of all Real numbers.
connectives. Let the domain consist of all
students in your class. ∀𝑥𝑥∃𝑦𝑦(𝑥𝑥 < 𝑦𝑦)
A student in your class has a cat, a dog, and ∀𝑥𝑥∀𝑦𝑦(((𝑥𝑥 ≥ 0) ∧ (𝑦𝑦 ≥ 0)) → (𝑥𝑥𝑥𝑥 ≥ 0))
a ferret.
∀𝑥𝑥∀𝑦𝑦∃𝑧𝑧(𝑥𝑥𝑥𝑥 = 𝑧𝑧)
All students in your class have a cat, a dog,
or a ferret. ∃𝑥𝑥∀𝑦𝑦(𝑥𝑥𝑥𝑥 = 𝑦𝑦)

∀𝑥𝑥∀𝑦𝑦(((𝑥𝑥 ≥ 0) ∧ (𝑦𝑦 < 0)) → (𝑥𝑥 − 𝑦𝑦 > 0))


Some student in your class has a cat and a
ferret, but not a dog. ∀𝑥𝑥∀𝑦𝑦∃𝑧𝑧(𝑥𝑥 = 𝑦𝑦 + 𝑧𝑧)

No student in your class has a cat, a dog,


and a ferret.
Let Q(x, y) be the statement “x has sent an
For each of the three animals, cats, dogs, e-mail message to y,” where the domain for
and ferrets, there is a student in your class both x and y consists of all students in your
who has this animal as a pet. class. Express each of these quantifications
in English.

∃𝑥𝑥∃𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦)
Let P(x) be the statement “x can speak
Russian” and let Q(x) be the statement “x ∃𝑥𝑥∀𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦)
knows the computer language C++”.
∀𝑥𝑥∃𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦)
Express each of these sentences in terms of
P(x), Q(x), quantifiers, and logical ∃𝑦𝑦∀𝑥𝑥𝑥𝑥(𝑥𝑥, 𝑦𝑦)
connectives. The domain for quantifiers
consists of all students at your school. ∀𝑦𝑦∃𝑥𝑥 𝑄𝑄(𝑥𝑥, 𝑦𝑦)

∀𝑥𝑥∀𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦)
There is a student at your school who can
speak Russian and who knows C++. Let T (x, y) mean that student x likes cuisine
y, where the domain for x consists of all
There is a student at your school who can
students at your school and the domain for
speak Russian but who doesn’t know C++.
y consists of all cuisines. Express each of
Every student at your school either can these statements by a simple English
1

speak Russian or knows C++. sentence.


Page

Topic: Predicate Logic


Discrete Structures Practice Questions

￢𝑇𝑇(𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴ℎ 𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻𝐻, 𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽𝐽) Some student has never been asked a


question by a faculty member.
∃𝑥𝑥𝑥𝑥(𝑥𝑥, 𝐾𝐾𝐾𝐾𝐾𝐾𝐾𝐾𝐾𝐾𝐾𝐾) ∧ ∀𝑥𝑥𝑥𝑥(𝑥𝑥, 𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀)
Express each of these mathematical
∃𝑦𝑦(𝑇𝑇(𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴𝐴, 𝑦𝑦) ∨
statements using predicates, quantifiers,
𝑇𝑇(𝐽𝐽𝐽𝐽𝐽𝐽 𝐽𝐽𝐽𝐽ℎ𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛, 𝑦𝑦))
logical connectives, and mathematical
∀𝑥𝑥∀𝑧𝑧∃𝑦𝑦((𝑥𝑥 ≠ 𝑧𝑧) → ￢(𝑇𝑇(𝑥𝑥, 𝑦𝑦) ∧ 𝑇𝑇(𝑧𝑧, 𝑦𝑦))) operators.

∃𝑥𝑥∃𝑧𝑧∀𝑦𝑦(𝑇𝑇(𝑥𝑥, 𝑦𝑦) ↔ 𝑇𝑇(𝑧𝑧, 𝑦𝑦)) The product of two negative real numbers is
positive.
∀𝑥𝑥∀𝑧𝑧∃𝑦𝑦(𝑇𝑇(𝑥𝑥, 𝑦𝑦) ↔ 𝑇𝑇(𝑧𝑧, 𝑦𝑦))
The difference of a real number and itself is
Let S(x) be the predicate “x is a student,”
zero.
F(x) the predicate “x is a faculty member,”
and A(x, y) the predicate “x has asked y a Every positive real number has exactly two
question,” where the domain consists of all square roots.
people associated with your school. Use
quantifiers to express each of these A negative real number does not have a
statements. square root that is a real number.

Lois has asked Professor Michaels a Express the negations of each of these
question. statements so that all negation symbols
immediately precede predicates.
Every student has asked Professor Gross a
question. ∀𝑥𝑥∃𝑦𝑦∀𝑧𝑧𝑧𝑧(𝑥𝑥, 𝑦𝑦, 𝑧𝑧)

∀𝑥𝑥∃𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦) ∨ ∀𝑥𝑥∃𝑦𝑦𝑦𝑦(𝑥𝑥, 𝑦𝑦)


Every faculty member has either asked
Professor Miller a question or been asked a ∀𝑥𝑥∃𝑦𝑦(𝑃𝑃(𝑥𝑥, 𝑦𝑦) ∧ ∃𝑧𝑧𝑧𝑧(𝑥𝑥, 𝑦𝑦, 𝑧𝑧))
question by Professor Miller.
∀𝑥𝑥∃𝑦𝑦(𝑃𝑃(𝑥𝑥, 𝑦𝑦) → 𝑄𝑄(𝑥𝑥, 𝑦𝑦))
Some student has not asked any faculty
member a question. Find a common domain for the variables x,
y, and z for which the statement
There is a faculty member who has never ∀𝒙𝒙∀𝒚𝒚((𝒙𝒙 ≠ 𝒚𝒚) → ∀𝒛𝒛((𝒛𝒛 = 𝒙𝒙) ∨ (𝒛𝒛 = 𝒚𝒚)))
been asked a question by a student. is true and another domain for which it is
false.
Some student has asked every faculty
member a question.

There is a faculty member who has asked


every other faculty member a question.
2
Page

Topic: Predicate Logic

You might also like