Discrete Mathematics

(Predicate Logic
MCQ’s
Quantifiers )
By
Muhammad Sohaib Yousaf
Predicate Logic
Quantifiers
•
Let P (x) denote the statement “x >7.” Which of these have truth value
true?
a) P (0)
b) P (4)
c) P (6)
d) P (9)
Predicate Logic
Quantifiers
• Let P (x) denote the statement “x >7.” Which of these have truth value
true?
a) P (0)
b) P (4)
c) P (6)
d) P (9)
View Answer
• Answer: d
Explanation: Put x=9, 9>7 which is true.
Predicate Logic
Quantifiers
•
Let Q(x) be the statement “x < 5.” What is the truth value of the
quantification ∀xQ(x), having domains as real numbers.
a) True
b) False
Predicate Logic
Quantifiers
• Let Q(x) be the statement “x < 5.” What is the truth value of the
quantification ∀xQ(x), having domains as real numbers.
a) True
b) False
View Answer
• Answer: b
Explanation: Q(x) is not true for every real number x, because, for
instance, Q(6) is false. That is, x = 6 is a counterexample for the
statement ∀xQ(x). This is false
Predicate Logic
Quantifiers
Determine the truth value of ∀n(n + 1 > n) if the domain consists of
•
all real numbers.
a) True
b) False
Predicate Logic
Quantifiers
• Determine the truth value of ∀n(n + 1 > n) if the domain consists of
all real numbers.
a) True
b) False
View Answer
• Answer: a
Explanation: There are no elements in the domain for which the
statement is false.
Predicate Logic
Quantifiers
•
Let P(x) denote the statement “x = x + 7.” What is the truth value of
the quantification ∃xP(x), where the domain consists of all real
numbers?
a) True
b) False
Predicate Logic
Quantifiers
• Let P(x) denote the statement “x = x + 7.” What is the truth value of
the quantification ∃xP(x), where the domain consists of all real
numbers?
a) True
b) False
View Answer
• Answer: b
Explanation: Because P(x) is false for every real number x, the
existential quantification of Q(x), which is ∃xP(x), is false
Predicate Logic
Quantifiers
•
Let R (x) denote the statement “x > 2.” What is the truth value of the
quantification ∃xR(x), having domain as real numbers?
a) True
b) False
Predicate Logic
Quantifiers
• Let R (x) denote the statement “x > 2.” What is the truth value of the
quantification ∃xR(x), having domain as real numbers?
a) True
b) False
View Answer
• Answer: a
Explanation: Because “x > 2” is sometimes true—for instance, when x
= 3–the existential quantification of R(x), which is ∃xR(x), is true
Predicate Logic
Quantifiers
•
The statement,” Every comedian is funny” where C(x) is “x is a
comedian” and F (x) is “x is funny” and the domain consists of all
people.
a) ∃x(C(x) ∧F (x))
b) ∀x(C(x) ∧F (x))
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x))
Predicate Logic
Quantifiers
• The statement,” Every comedian is funny” where C(x) is “x is a
comedian” and F (x) is “x is funny” and the domain consists of all
people.
a) ∃x(C(x) ∧F (x))
b) ∀x(C(x) ∧F (x))
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x))
View Answer
• Answer: d
Explanation: For every person x, if comedian then x is funny
Predicate Logic
Quantifiers
•
”Everyone wants to learn cosmology.” This argument may be true for
which domains?
a) All students in your cosmology class
b) All the cosmology learning students in the world
c) Both of the mentioned
d) None of the mentioned
Predicate Logic
Quantifiers
• ”Everyone wants to learn cosmology.” This argument may be true for
which domains?
a) All students in your cosmology class
b) All the cosmology learning students in the world
c) Both of the mentioned
d) None of the mentioned
View Answer
• Answer: c
Explanation: Domain may be limited to your class or may be whole
world both are good as it satisfies universal quantifier.
Logical
Equivalences
•
The compound propositions p and q are called logically equivalent if
________ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨q)
d) ¬p ∨¬q
Logical
Equivalences
• The compound propositions p and q are called logically equivalent if
________ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨q)
d) ¬p ∨¬q
View Answer
• Answer: a
Explanation: Definition of logical equivalence
Logical
Equivalences
•
p → q is logically equivalent to ________
a) ¬p ∨¬q
b) p ∨¬q
c) ¬p ∨q
d) ¬p ∧q
Logical
Equivalences
• p → q is logically equivalent to ________
a) ¬p ∨¬q
b) p ∨¬q
c) ¬p ∨q
d) ¬p ∧q
View Answer
• Answer: c
Explanation: (p → q) ↔ (¬p ∨q) is tautology.
Logical
Equivalences
• ∨
p q is logically equivalent to ________
a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
Logical
Equivalences
• ∨
p q is logically equivalent to ________
a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
View Answer
• Answer: d
Explanation: (p ∨q) ↔ (¬p → q) is tautology
Logical
Equivalences
•
¬ (p ↔ q) is logically equivalent to ________
a) q↔p
b) p↔¬q
c) ¬p↔¬q
d) ¬q↔¬p
Logical
Equivalences
• ¬ (p ↔ q) is logically equivalent to ________
a) q↔p
b) p↔¬q
c) ¬p↔¬q
d) ¬q↔¬p
View Answer
• Answer: b
Explanation: ¬(p↔q)↔(p↔¬q) is tautology.
Logical
Equivalences
• ∧
p q is logically equivalent to ________
a) ¬ (p → ¬q)
b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)
Logical
Equivalences
• ∧
p q is logically equivalent to ________
a) ¬ (p → ¬q)
b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)
View Answer
• Answer: a
Explanation: (p ∧q) ↔ (¬(p → ¬q)) is tautology.
Logical
Equivalences
•
Which of the following statement is correct?
a) p ∨q ≡ q ∨p
b) ¬(p ∧q) ≡ ¬p ∨¬q
c) (p ∨q) ∨r ≡ p ∨(q ∨r)
d) All of mentioned
Logical
Equivalences
• Which of the following statement is correct?
a) p ∨q ≡ q ∨p
b) ¬(p ∧q) ≡ ¬p ∨¬q
c) (p ∨q) ∨r ≡ p ∨(q ∨r)
d) All of mentioned
View Answer
• Answer: d
Explanation: Verify using truth table, all are correct.
Logical
Equivalences
•
p ↔ q is logically equivalent to ________
a) (p → q) → (q → p)
b) (p → q) ∨(q → p)
c) (p → q) ∧(q → p)
d) (p ∧q) → (q ∧p)
Logical
Equivalences
• p ↔ q is logically equivalent to ________
a) (p → q) → (q → p)
b) (p → q) ∨(q → p)
c) (p → q) ∧(q → p)
d) (p ∧q) → (q ∧p)
View Answer
• Answer: c
Explanation: (p ↔ q) ↔ ((p → q) ∧(q → p)) is tautology.
Logical
Equivalences
• ∧
(p → q) (p → r) is logically equivalent to ________
a) p → (q ∧r)
b) p → (q ∨r)
c) p ∧(q ∨r)
d) p ∨(q ∧r)
Logical
Equivalences
• ∧
(p → q) (p → r) is logically equivalent to ________
a) p → (q ∧r)
b) p → (q ∨r)
c) p ∧(q ∨r)
d) p ∨(q ∧r)
View Answer
• Answer: a
Explanation: ((p → q) ∧(p → r)) ↔ (p → (q ∧r)) is tautology.
Logical
Equivalences
• ∨
(p → r) (q → r) is logically equivalent to ________
a) (p ∧q) ∨r
b) (p ∨q) → r
c) (p ∧q) → r
d) (p → q) → r
View Answer
• Answer: c
Explanation: ((p → r) ∨(q → r)) ↔ ((p ∧q) → r) is tautology.
Logical
Equivalences
• ∨
(p → r) (q → r) is logically equivalent to ________
a) (p ∧q) ∨r
b) (p ∨q) → r
c) (p ∧q) → r
d) (p → q) → r
View Answer
• Answer: c
Explanation: ((p → r) ∨(q → r)) ↔ ((p ∧q) → r) is tautology.
Logical
Equivalences
•
¬ (p ↔ q) is logically equivalent to ________
a) p ↔ ¬q
b) ¬p ↔ q
c) ¬p ↔ ¬q
d) ¬q ↔ ¬p
Logical
Equivalences
• ¬ (p ↔ q) is logically equivalent to ________
a) p ↔ ¬q
b) ¬p ↔ q
c) ¬p ↔ ¬q
d) ¬q ↔ ¬p
View Answer
• Answer: a
Explanation: (¬ (p ↔ q)) ↔ (p ↔ ¬q) is tautology.