Which description best defines a predicate?
7/9 7. Predicates and Quantifiers Online Quiz Questions
Use this free practice quiz with 20 questions to review 7/9 7. Predicates and Quantifiers, test your knowledge, and prepare for your next test or exam.
The statement ∃xP(x) means that at least one object in the domain makes P(x) true.
- A
True
- B
False
What is the standard term for the collection of objects that a variable may represent in a discussion?
Let S(x) mean “x is a student” and P(x) mean “x is present,” with the domain consisting of all people. Which formula translates “Every student is present”?
- A
∀x(S(x)∧P(x))
- B
∃x(S(x)∧P(x))
- C
∀x(S(x)→P(x))
- D
∃x(S(x)→P(x))
Which statements correctly describe evidence for quantified claims? Select all that apply.
- A
One counterexample is enough to disprove a universal claim.
- B
One witness is enough to prove an existential claim.
- C
One witness is enough to prove a universal claim.
- D
One counterexample is enough to disprove an existential claim.
True or false: In the formula ∀xP(x), the variable x is bound.
- A
True
- B
False
What is the status of the variable x in the unquantified expression P(x)?
Let L(x,y) mean “x likes y.” Which formula translates “There is someone whom everyone likes”?
- A
∀x∃yL(x,y)
- B
∀y∃xL(x,y)
- C
∃x∀yL(x,y)
- D
∃y∀xL(x,y)
Let D(x) mean “x is a dog” and R(x) mean “x is a reptile.” Which formulas correctly express “No dogs are reptiles”? Select all that apply.
- A
∀x(D(x)→¬R(x))
- B
∀x(R(x)→¬D(x))
- C
¬∃x(D(x)∧R(x))
- D
∃x(D(x)→¬R(x))
Explain how to negate ∀xP(x). Give the equivalent symbolic form and an ordinary-language interpretation.
Let the domain be the integers and let E(x) mean x>0. What is the truth value of E(−3)?
- A
True, because −3 is an integer
- B
False, because −3 is not greater than zero
- C
True, because every integer satisfies the predicate
- D
False, because E(x) is not a proposition
Assume the domain is all people. Let S(x) mean “x is a student” and A(x) mean “x submitted the assignment.” Which formula correctly translates “Every student submitted the assignment”?
- A
∀x(S(x)∧A(x))
- B
∃x(S(x)∧A(x))
- C
∀x(S(x)→A(x))
- D
∃x(S(x)→A(x))
Let S(x) mean “x is a student” and P(x) mean “x passed the exam.” Which formula correctly translates “Some student passed the exam”?
- A
∃x(S(x)∧P(x))
- B
∀x(S(x)∧P(x))
- C
∃x(S(x)→P(x))
- D
∀x(S(x)→P(x))
Let L(x,y) mean “x likes y.” What does ∀x∃yL(x,y) mean?
- A
There is one person whom everyone likes.
- B
Everyone likes every person.
- C
Everyone likes at least one person, possibly a different person for each individual.
- D
Exactly one person likes everyone.
Which formula is logically equivalent to ¬∀xP(x)?
- A
∀x¬P(x)
- B
¬∃xP(x)
- C
∃xP(x)
- D
∃x¬P(x)
True or false: ∃xP(x) means that exactly one object in the domain satisfies P(x).
- A
True
- B
False
In the formula ∀xP(x), what is the technical term for the variable x?
What is the technical term for an object that demonstrates that ∃xP(x) is true?
In the formula ∀x(P(x)→Q(x)), the subformula P(x)→Q(x) is the quantifier's .
In the formula ∀x((P(x)∧x>2)→O(x)), the subformula P(x)∧x>2 is the conditional's .