Paper 2 · free lessons

Logic & proof for the TMUA

Learn statements, conditions, quantifiers, proof methods and common errors for Paper 2.

Paper 2 question types and implication explorer
Paper
Paper 2
Lessons free
2 of 8
Free lesson time
13 min
All lessons
89 min

In the released papers: 86 of 320 questions.

What the specification says

Logic & proof on the TMUA

Read the full specification(PDF from UAT-UK, opens in a new tab)
  • Interpret implication, converse, contrapositive, equivalence and inclusive ‘or’.

  • Distinguish necessary and sufficient conditions.

  • Negate quantified statements and respect quantifier order.

  • Use direct proof, cases, contradiction and counterexamples.

  • Identify invalid steps involving division, roots, squaring, inequalities and unstated assumptions.

Lesson 1 · 6 min

Translate the direction first

Words such as ‘only if’ and ‘if and only if’ encode directions that must be separated before testing examples.

The idea

Mathematical language fixes direction. ‘If PP, then QQ’ makes PP the premise and QQ the conclusion; its converse swaps them and may have a different truth value.

A universal statement ranges over every permitted object. A single overlooked domain qualifier can change a true statement into a false one.

When to use it

Rewrite each sentence as premise, conclusion and domain before judging examples or implications.

Main steps

  1. 1

    ‘A only if B’ means A⇒BA\Rightarrow B.

  2. 2

    The converse of A⇒BA\Rightarrow B is B⇒AB\Rightarrow A and need not be true.

  3. 3

    ‘A if and only if B’ requires both A⇒BA\Rightarrow B and B⇒AB\Rightarrow A.

Worked example

Interpret: an integer is divisible by 66 only if it is even.

Try it first, then show the solution
  1. 1

    Let AA be ‘divisible by 66’ and BB be ‘even’.

  2. 2

    ‘A only if B’ means begin with AA and conclude BB.

  3. 3

    Every multiple of 66 contains a factor 22.

Answer

If an integer is divisible by 66, then it is even.

Lesson check

Try this without looking back at the example.

‘x=2x=2 only if x2=4x^2=4’ means

Answer options

Save your progress and track this lesson's check with a free account.

Create a free account

Lesson 2 · 7 min

Separate necessary from sufficient

Test each direction independently instead of assuming related conditions are equivalent.

The idea

A sufficient condition guarantees the result; a necessary condition is required by the result. They correspond to opposite set containments and must be tested in opposite directions.

A condition can be both, either or neither. Counterexamples should be designed with the premise true and conclusion false for the exact implication under test.

When to use it

Draw or imagine the two sets, state which must sit inside which, and test that direction only.

Main steps

  1. 1

    A sufficient condition guarantees the result; it may be stronger than needed.

  2. 2

    A necessary condition must hold whenever the result holds; it may not guarantee the result.

  3. 3

    The contrapositive ¬B⇒¬A\neg B\Rightarrow\neg A is logically equivalent to A⇒BA\Rightarrow B.

Worked example

For real xx, is x=3x=3 necessary, sufficient, both or neither for x2=9x^2=9?

Try it first, then show the solution
  1. 1

    To test sufficiency, assume the proposed condition x=3x=3. Substitution gives x2=9x^2=9, so the condition guarantees the result.

  2. 2

    To test necessity, start from the result instead: x2=9x^2=9 gives x=3x=3 or x=−3x=-3.

  3. 3

    The value x=−3x=-3 satisfies the result but not the proposed condition. One such counterexample is enough to disprove necessity.

  4. 4

    State the two decisions separately: sufficient is true; necessary is false. The direction being tested determines which statement you assume.

Answer

x=3x=3 is sufficient but not necessary for x2=9x^2=9.

Lesson check

Try this without looking back at the example.

Being divisible by 22 is what kind of condition for being divisible by 66?

Answer options

Save your progress and track this lesson's check with a free account.

Create a free account

Included with premium

6 more logic & proof lessons

These go further, up to difficulty 4–5 question types, and connect to matched practice from the question bank.

  • Negate the whole quantified claim

    A correct negation changes the quantifier and negates the mathematical condition.

    7 minPremium

  • Choose the shortest valid proof

    Match the form of the claim to direct proof, cases, contradiction or a counterexample.

    7 minPremium

  • Check reversibility and hidden assumptions

    Many convincing-looking arguments fail because a step loses cases, adds cases or uses an expression outside its domain.

    7 minPremium

  • Test conditions together

    Top-end logic questions combine several claims. Translate each condition into a set and test sufficiency and necessity in the correct direction.

    16 minDifficulty 4–5Premium

  • Nested quantifiers: track who may depend on whom

    Distinguish a witness chosen separately for every input from one universal witness, and negate alternating quantifiers one layer at a time.

    20 minDifficulty 4–5Premium

  • Solve self-referential truth systems as fixed points

    Turn each speaker's claim into a Boolean equation and keep only truth assignments whose statements agree with their assigned truth values.

    19 minDifficulty 4–5Premium

Your next step

Practise logic & proof under exam conditions

Free, no account needed

Take the timed diagnostic

20 Forge-original questions under exam timing, calibrated to the 2023 paper's difficulty profile. You get a score and a topic-by-topic breakdown at the end.

Start the free diagnostic

Free account

Save your progress

Create a free account for 41 free lessons and 4 methods in Learn, with progress kept on this device, and free sittings of released past papers.

Create a free account

Premium

Practise at the harder level

561 Forge originals calibrated for the harder computer-based papers sat since 2024, with worked solutions, unlimited mocks, all 104 lessons and 18 methods.

£49 for 12 months or £20 for 30 days. One payment, no automatic renewal.

See premium