Computer Science I / Predicate Logic and Quantifiers
Practice question · True or false

The negation of "every student passed" is "no student passed".

Hints
  1. How much evidence does it take to refute a universal claim?
  2. One failure is enough.
Show the answer

False

Why

False. ¬xP(x)\lnot\forall x\,P(x) is x¬P(x)\exists x\,\lnot P(x), some student did not pass. 'No student passed' is x¬P(x)\forall x\,\lnot P(x), a far stronger claim. Confusing the contrary with the contradictory is one of the most common quantifier errors, and it is why a single counterexample settles a universal.

Read the lesson: Predicate Logic and Quantifiers →

Practise Predicate Logic and Quantifiers

The app has 4 more questions on this lesson, and keeps your place in the course. Computer Science I is free to start.

More questions on Predicate Logic and Quantifiers