Negation is mechanical: swap every quantifier and flip the predicate. 'Not (P and Q)' becomes '(not P) or (not Q)'; 'not (P or Q)' becomes '(not P) and (not Q)' — De Morgan in both directions, with the connective always changing. Intervals obey the same rule: the negation of 'x > 2 and x < 5' is 'x ≤ 2 or x ≥ 5', flipping each strict inequality to its weak opposite and swapping 'and' for 'or'. Treat the connective swap as non-negotiable: any 'negation' that keeps 'and' as 'and' is automatically wrong, however tempting the flipped inequalities look.
An implication fails in exactly one way: 'If P then Q' negates to 'P and not Q' — the alarm rang and someone stayed; the homework was submitted and the test was failed. Negating 'for all' gives 'there exists … not': the denial of 'every prime above 2 is odd' needs only some prime above 2 that is even, not the extreme 'every prime is even'. Negating 'there exists' gives 'for all … not'. Work outside-in through nested quantifiers: denying 'for every n there is a prime m above n' yields some n that caps all primes.
Traps: negating too much (the opposite extreme), keeping the connective while negating the parts, or flipping the quantifier without flipping the predicate. Write the logical form first — ∀/∃, and/or, if/then — then apply the swaps line by line. Done carefully, negation questions are free marks: no insight required, just the machine. Pair this hub with quantifiers: most negation stems are just ∀/∃ claims wearing prose, and the drill sets for both topics draw from the same trap family.
Study method: attempt five timed questions, log every miss with its topic code, redo misses from scratch within 48 hours, then re-attempt the topic a week later. Pair each hub with its drill link below and a fortnightly full mock.
Place this topic in the wider test with the syllabus checklist and Paper 1 vs Paper 2, learn the timing system in how to prepare, and check what scores mean in scores explained.