Suppose is true and is false. What is the truth value of the conditional ?
01 Logic and Quantifiers Online Quiz Questions
Use this free practice quiz with 20 questions to review 01 Logic and Quantifiers, test your knowledge, and prepare for your next test or exam.
Which condition makes the disjunction p∨q true in standard mathematical logic?
- A
It is true only when both p and q are true.
- B
It is false whenever exactly one of p and q is true.
- C
It is true whenever at least one of p and q is true.
- D
It is always false unless p and q have the same truth value.
Which expression is the correct negation of ∀x∈R(x≥4)?
- A
∃x∈R(x<4)
- B
∀x∈R(x<4)
- C
∃x∈R(x>4)
- D
∀x∈R(x≤4)
True or false: The sentence x+2=5 is a proposition before any value is assigned to x.
- A
True
- B
False
True or false: The biconditional p↔q is false whenever both p and q are false.
- A
True
- B
False
What is the standard term for a proposition that is false for every possible assignment of its variables?
How many rows are required in a complete truth table for two distinct propositions, p and q?
Complete the translation explanation: In “Only users may access the system,” being is required for access.
The quantifier ∀ means object, while ∃ means .
Using the relation R(x,y), write a formula expressing that a particular object x is related to at least one object y.
Which expression is logically equivalent to p→q?
- A
p∧q
- B
¬p∨q
- C
p∨¬q
- D
¬(p∨q)
Which statements correctly compare ∀x∃yR(x,y) with ∃y∀xR(x,y)? Select all correct choices.
- A
∀x∃yR(x,y) allows a different y for different x.
- B
∃y∀xR(x,y) always follows from ∀x∃yR(x,y).
- C
The two quantifier orders are always logically equivalent.
- D
∃y∀xR(x,y) requires one particular y to work for every x.
Which sentence is a proposition?
- A
7 is prime.
- B
Close the door.
- C
Is the test tomorrow?
- D
x+2=5.
Let p be false and q be true. What is the truth value of p→q?
- A
True
- B
False
True or false: The disjunction p∨q is false whenever exactly one of p and q is true.
- A
True
- B
False
What is the logical term for a proposition that is true for every possible assignment of its variables?
Which expression is logically equivalent to ¬(p∨¬q)?
- A
¬p∨q
- B
¬p∧q
- C
p∧¬q
- D
p∨¬q
Write the negation of the inequality x≥3.
How many rows must a complete truth table have if the compound proposition contains three distinct propositions?
- A
3
- B
6
- C
8
- D
9
Select all expressions that are logically equivalent to p∧(q∨r). Choose every correct option.
- A
(p∧q)∨(p∧r)
- B
(q∨r)∧p
- C
p∨(q∧r)
- D
(p∧q)∨r