Negation means “when this entire claim fails”
Consider “Every number in the list is positive.” You can disprove it by finding one number that is zero or negative. You do not have to show that every number is negative. This small distinction explains many attractive wrong options.
Read the domain first: integers, real numbers, positive values or a specified list. Keep that domain when negating. Then identify the quantifier and the condition. A good negation covers every way the original can fail and none of the ways it can still be true.
Three moves to use before choosing an answer
Every → at least one exception
“Every x has P” becomes “some x does not have P”. You need a witness, not a universal opposite.
Some → no examples
“Some x has P” becomes “every x lacks P”. One unsuccessful example cannot disprove existence.
For a conditional, identify the premise and conclusion. “If A then B” fails when A is true and B is false. Preserve the boundary: the negation of x>2 is x≤2; the negation of x≥2 is x<2. Equality must belong to one side.
With nested claims, work from the outside inward. Do not swap the order of the variables. “For every x there exists a y” allows y to depend on x; “there exists a y for every x” requires one choice that works for all x.
Try the twelve traps
Review an error in four lines
For each miss, write the original statement, its domain, the exact negation and a concrete example illustrating the distinction. For a true implication, explain what a counterexample would have to look like even if no such example exists.
A repair for the boundary trap
Original: every root is greater than 2. Negation: there is a root at or below 2. Test the boundary explicitly: a root at x=2 disproves the original, so any answer omitting equality is incomplete.
Return tomorrow to the questions you missed and reconstruct their logic before opening the options. Recognition of a remembered letter is not the same as understanding the sentence.
Connect the language to mathematical reasoning
The current TMUA specification includes quantifiers and negation within the logic strand. You are not required to use symbolic logic notation or complete formal truth tables. Accurate English and well-chosen mathematical examples are enough.
Continue with the necessary and sufficient conditions guide, then practise mixed reasoning where the question does not announce which rule it is testing. Within the TMUA Question Bank, select a focused reasoning topic and explain the wrong choices as well as the right one.
Study suggestion: exchange two statements with a study partner. Each person writes the negation and a boundary case. If you disagree, test a specific example before debating terminology.
Common questions
Does “some” mean more than one?
What is the negation of “if A then B”?
Can a universal statement about an empty set be true?
Do I need formal symbols for TMUA logic?
How should I use the quiz score?
Sources & further reading
Official rules and programme details can change. Use the linked source for your exact course, competition or examination session.
- TMUA specificationLogic, proof, quantifiers and notation scope.
- UAT-UK preparationOfficial Notes on Logic and Proof.


