Free Practice Quiz Question List

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.

20 questions
01
Choose one
1 point

Suppose pp is true and qq is false. What is the truth value of the conditional p→qp\to q?

  1. A

    True

  2. B

    False

  3. C

    It depends on the domain

  4. D

    It is not a proposition

02
Choose one
1 point

Which condition makes the disjunction p∨qp\lor q true in standard mathematical logic?

  1. A

    It is true only when both pp and qq are true.

  2. B

    It is false whenever exactly one of pp and qq is true.

  3. C

    It is true whenever at least one of pp and qq is true.

  4. D

    It is always false unless pp and qq have the same truth value.

03
Choose one
1 point

Which expression is the correct negation of ∀x∈R  (x≥4)\forall x\in\mathbb R\;(x\ge 4)?

  1. A

    ∃x∈R  (x<4)\exists x\in\mathbb R\;(x<4)

  2. B

    ∀x∈R  (x<4)\forall x\in\mathbb R\;(x<4)

  3. C

    ∃x∈R  (x>4)\exists x\in\mathbb R\;(x>4)

  4. D

    ∀x∈R  (x≤4)\forall x\in\mathbb R\;(x\le 4)

04
True or false
1 point

True or false: The sentence x+2=5x+2=5 is a proposition before any value is assigned to xx.

  1. A

    True

  2. B

    False

05
True or false
1 point

True or false: The biconditional p↔qp\leftrightarrow q is false whenever both pp and qq are false.

  1. A

    True

  2. B

    False

06
Written response
1 point

What is the standard term for a proposition that is false for every possible assignment of its variables?

07
Written response
1 point

How many rows are required in a complete truth table for two distinct propositions, pp and qq?

08
Fill in the blank
1 point

Complete the translation explanation: In “Only users may access the system,” being is required for access.

09
Fill in the blank
1 point

The quantifier ∀\forall means object, while ∃\exists means .

10
Open ended
1 point

Using the relation R(x,y)R(x,y), write a formula expressing that a particular object xx is related to at least one object yy.

11
Choose one
1 point

Which expression is logically equivalent to p→qp\to q?

  1. A

    p∧qp\land q

  2. B

    ¬p∨q\neg p\lor q

  3. C

    p∨¬qp\lor\neg q

  4. D

    ¬(p∨q)\neg(p\lor q)

12
Choose all
1 point

Which statements correctly compare ∀x∃y  R(x,y)\forall x\exists y\;R(x,y) with ∃y∀x  R(x,y)\exists y\forall x\;R(x,y)? Select all correct choices.

  1. A

    ∀x∃y  R(x,y)\forall x\exists y\;R(x,y) allows a different yy for different xx.

  2. B

    ∃y∀x  R(x,y)\exists y\forall x\;R(x,y) always follows from ∀x∃y  R(x,y)\forall x\exists y\;R(x,y).

  3. C

    The two quantifier orders are always logically equivalent.

  4. D

    ∃y∀x  R(x,y)\exists y\forall x\;R(x,y) requires one particular yy to work for every xx.

13
Choose one
1 point

Which sentence is a proposition?

  1. A

    7 is prime.

  2. B

    Close the door.

  3. C

    Is the test tomorrow?

  4. D

    x+2=5.

14
Choose one
1 point

Let pp be false and qq be true. What is the truth value of p→qp\to q?

  1. A

    True

  2. B

    False

15
True or false
1 point

True or false: The disjunction p∨qp\lor q is false whenever exactly one of pp and qq is true.

  1. A

    True

  2. B

    False

16
Written response
1 point

What is the logical term for a proposition that is true for every possible assignment of its variables?

17
Choose one
1 point

Which expression is logically equivalent to ¬(p∨¬q)\neg(p\lor\neg q)?

  1. A

    ¬p∨q\neg p\lor q

  2. B

    ¬p∧q\neg p\land q

  3. C

    p∧¬qp\land\neg q

  4. D

    p∨¬qp\lor\neg q

18
Written response
1 point

Write the negation of the inequality x≥3x\ge 3.

19
Choose one
1 point

How many rows must a complete truth table have if the compound proposition contains three distinct propositions?

  1. A

    3

  2. B

    6

  3. C

    8

  4. D

    9

20
Choose all
1 point

Select all expressions that are logically equivalent to p∧(q∨r)p\land(q\lor r). Choose every correct option.

  1. A

    (p∧q)∨(p∧r)(p\land q)\lor(p\land r)

  2. B

    (q∨r)∧p(q\lor r)\land p

  3. C

    p∨(q∧r)p\lor(q\land r)

  4. D

    (p∧q)∨r(p\land q)\lor r