TMUA preparation guide
TMUA Logic and Proof: The Complete Paper 2 Reasoning Guide
Logic and proof is the block of the TMUA that school maths leaves you least prepared for: converse, "only if" and "for some" barely appear in A level teaching, yet they are the literal text of the Section 2 specification for Paper 2. This guide works through the official syllabus item by item: which way each of the four conditional forms points, why the contrapositive can always be trusted, why "for some" officially means "for at least one", how to negate quantified statements, where the errors hide in purported proofs, and how to use the official Notes on Logic and Proof.
10 sections2,803 words15 min read6 official sources
- Papers
- 28
- Questions
- 826
- Free to try
- 2
Logic and Proof at a Glance
- Where it is tested
- Paper 2 only: Mathematical Reasoning, 20 multiple-choice questions in 75 minutes
- The syllabus list
- Arg1 to Arg4 for logic, Prf1 to Prf5 for proof, Err1 and Err2 for errors; the lot fits on one page
- The direction rule
- "A only if B" means A implies B; a statement matches its contrapositive, never its converse
- Official gloss
- "For some" means "for at least one", synonymous with "there exists"
- Explicitly excluded
- Symbolic notation and formal truth tables; induction is absent from the proof-type list too
All of the above comes from Section 2 of the official TMUA specification and the official Notes on Logic and Proof. Both papers share the Section 1 mathematics, but Section 2 defines the scope of Paper 2 alone, so aim your logic practice squarely there.
In short
- The TMUA logic syllabus is four items (Arg1 to Arg4) plus four proof types and two error-spotting skills; it fits on one page and rewards item-by-item mastery over unfocused drilling.
- "A only if B" means A implies B, the same direction as "if A then B"; a statement always shares its truth value with its contrapositive but not with its converse.
- Officially "for some" means "for at least one", not the everyday "some but not all"; one counterexample refutes a "for all" claim, while refuting "there exists" means ruling out every case.
- The specification explicitly excludes symbolic notation and truth tables, and mathematical induction is absent from the official list of proof types; spend no preparation time on either.
- The official preparation route is three steps: read the specification, read the Notes on Logic and Proof, and practise past papers against the clock; the 2016 to 2023 papers remain valid, and with no penalty for wrong answers you should leave nothing blank.
I
Part 1 of 3
Sections 01 to 04
01
Why logic and proof decides Paper 2
Both TMUA papers draw on the same Section 1 mathematical knowledge, but Paper 2 (Mathematical Reasoning, 20 multiple-choice questions in 75 minutes) adds an entire extra block: Section 2, mathematical argument and proof. The official Notes on Logic and Proof put it plainly: the formal side of mathematics, that of theorems and proofs, is the main focus of Paper 2. Paper 1 asks whether you can use mathematics; Paper 2 also asks whether you can reason about it, deciding whether statements are true or false, judging whether a chain of deductions holds, and spotting the exact line where a purported proof goes wrong.
Section 2: mathematical argument and proof
Defines the scope of Paper 2 alone, and the whole list fits on a page
Logic: Arg1 to Arg4Four syllabus items
- Arg1: true and false, and, or, not, and the four conditional forms
- Arg1: converse, contrapositive and their truth relationships
- Arg2: necessary and sufficient
- Arg3: the quantifiers for all, for some, there exists
- Arg4: negating statements that use any of those terms
Proof: Prf1 to Prf5Four proof types plus four skills
- Prf1: direct deduction, cases, contradiction, counterexample
- Prf2: deducing implications from given statements
- Prf3: conjecturing from small cases, then justifying
- Prf4: rearranging scrambled statements into a proof
- Prf5: problems needing a sophisticated chain of reasoning
Errors: Err1 and Err2Identifying errors in purported proofs
- Cancelling to pass from ab = ac to b = c
- Passing from sin A = sin B to A = B
Explicitly out of scopePreparation time you get back
- Symbolic notation for the logic terms
- Formal truth tables
- Mathematical induction (absent from the proof-type list)
Tap a branch to unfold
20 in 75 min
The shape of Paper 2, multiple choice throughout
About 4.5
Where a typical candidate scored, per the October 2025 official figures
Roughly 10%
Share of candidates scoring above 7.0
If you have come through A level maths or an international equivalent, very little of this language will have been taught explicitly. Converse, contrapositive and "only if" appear rarely in school courses, and question styles such as rearranging a scrambled proof are hardly practised at all. Yet the underlying ideas, necessary and sufficient conditions, proof by contradiction, counterexamples, are things most strong students half-know already. UAT-UK is equally open that the test is designed to be challenging and to separate applicants who all hold top school grades. Precisely because so few candidates have studied formal reasoning systematically, this is the highest-leverage block on the paper.
02
Arg1: the four conditional forms, and which way each one points
Arg1 asks you to understand true and false, the connectives and, or and not, and four forms of conditional statement. The specification notes that "or" is always inclusive: "A or B" is true when at least one side holds, including when both do.
| Reading | Direction of implication | |
|---|---|---|
| if A then B | whenever A holds, B must hold | A implies B |
| A if B | whenever B holds, A must hold | B implies A |
| A only if B | A cannot hold without B | A implies B |
| A if and only if B | both of the above | A and B imply each other |
The third row is where marks are lost: "only if" points the same way as "if A then B", not the other way round.
"A only if B" says that B is a precondition for A: if A has happened, B must be in place, so the implication runs from A to B. Many candidates instinctively read it the other way round, as though "only if" turned B into a guarantee of A. It does not. A quick sanity check: "a number is a multiple of four only if it is even" is plainly true, and the implication it expresses runs from "multiple of four" to "even", not backwards.
A worthwhile drill: take any simple mathematical statement, rewrite it in all four forms, and say out loud which side implies which each time. Ten minutes of this pays for itself many times over, because converse, contrapositive, necessity, sufficiency and negation are all built on top of these four readings.
03
Converse and contrapositive: which one you can trust
Arg1 also names the converse, the contrapositive and, crucially, the relationship between the truth of a statement and the truth of these derived statements. Everything below starts from "if A then B".
Converse
if B then A
Independent: may be true or false when the original is true
Contrapositive
if not B then not A
Always shares the original's truth value, so you may swap one for the other
Inverse
if not A then not B
The contrapositive of the converse, so it stands or falls with the converse, never with the original
Two facts need to become reflexes. A statement and its contrapositive are logically equivalent, so you may freely swap one for the other mid-argument. The converse is logically independent: knowing "if A then B" is true tells you nothing at all about "if B then A".
A typical Paper 2 question hands you one true conditional and asks which related statements must also be true, with converse, contrapositive and inverse mixed among the options. Candidates who classify each option instantly collect the mark in seconds; those who reason every one out from first principles burn time they need elsewhere. It is also worth building the habit of rewriting an awkward conditional as its contrapositive before judging it: the two are equivalent, so work with whichever is easier, and a good deal of proof-writing turns on exactly this move.
04
Arg2: necessary and sufficient, translated precisely
Arg2 is one line long: understand and use the terms necessary and sufficient. The concepts themselves are elementary and most strong students already have them. The marks are lost in translation between this vocabulary and the conditional forms of Arg1.
| Equivalent conditional | Direction | |
|---|---|---|
| A is sufficient for B | if A then B | A implies B |
| A is necessary for B | B only if A, i.e. if B then A | B implies A |
| A is necessary and sufficient for B | A if and only if B | each implies the other |
The anchor: sufficient means "having A is enough to secure B", so A sits at the start of the implication; necessary means "B cannot happen without A", so A sits at the finish.
Watch for compound phrasings such as "necessary but not sufficient": that asserts two things at once, that B implies A and that A does not imply B. Paper 2 likes to wrap these phrases around concrete mathematical objects: divisibility, inequalities, properties of functions. Reading by feel is precisely what such questions are designed to punish, so run a mechanical three-step routine instead.
01Step 1
Translate into directions first
Turn the English into "which side implies which, and which implication fails", and touch no mathematics until that is written down.
02Step 2
Test each direction against the maths
Put the actual objects in, divisibility, inequalities, properties of functions, and check one implication at a time rather than both at once.
03Step 3
Hunt a counterexample to the suspect direction
Where you suspect an implication is false, go looking for a counterexample. This step links directly to the proof skills later in the syllabus.
II
Part 2 of 3
Sections 05 to 08
05
Arg3: quantifiers, and the official meaning of "for some"
Arg3 lists three quantifier phrases: for all, for some, and there exists. The specification adds a parenthetical gloss to the middle one, and that gloss is the whole point: for some means "for at least one".
In everyday English, "some" usually carries the suggestion "some but not all". In TMUA usage that suggestion must be switched off entirely. "For some" and "there exists" are synonyms: the statement is true provided at least one object satisfies the condition, and it stays true even when every object does. So, over a non-empty range, a true "for all" statement automatically makes the matching "for some" statement true as well. Candidates who cling to the conversational reading will mark true statements false.
| To show it true | To show it false | |
|---|---|---|
| "For all" statements | an argument covering every case | exactly one counterexample |
| "For some" and "there exists" statements | a single positive example | showing that no object at all works |
Internalising that asymmetry saves real time. Before computing anything, ask which side of it you are standing on: am I hunting for one example, or ruling out all of them? That single question turns most quantifier items from traps into routine checks, and this precision is exactly what Paper 2 exists to test.
06
Arg4: negation, the most algorithmic skill on the syllabus
Arg4 requires you to negate statements that use any of the terms above. It is the most algorithmic item in the logic block: the rules are purely mechanical and can simply be applied.
for all x, P
there exists x such that not P
Defeating a universal claim takes one counterexample
there exists x, P (equally for some x, P)
for all x, not P
Defeating an existence claim means ruling out every object
A and B
not A or not B
The connective flips from and to or
A or B
not A and not B
With "or" still inclusive, both sides must fail
if A then B
A holds and B fails
Not "if A then not B": the only way a conditional can be false is hypothesis without conclusion
The last rule deserves a box around it. Writing the negation of a conditional as "if A then not B" is one of the most reliable wrong instincts Paper 2 exploits, and it surfaces again inside proof questions whenever an argument by contradiction opens by supposing the statement is false. Nested quantifiers are the other high-frequency trap: negating "for all x there exists y such that P" flips each quantifier in turn, giving "there exists x such that for all y, not P", and the order must be preserved layer by layer.
The practice routine is straightforward. Take the statement of any theorem from a textbook, write its negation, then translate that negation back into plain language and check that it says something sensible. Since the specification states that symbolic notation will not be expected, practise negating in words from the very start rather than drilling symbols and translating afterwards.
07
The four proof types and how to recognise each
Prf1 lists exactly four types of proof, and it is worth stating what is absent before what is present: mathematical induction is not on the list. The word appears nowhere in the content specification and nowhere in the official Notes on Logic and Proof. If you know induction from A level Further Maths or elsewhere, that knowledge does no harm, but it is not a TMUA syllabus item and deserves none of your TMUA preparation time.
| Idea | Recognition cue | |
|---|---|---|
| Direct deductive proof | reason step by step from the givens to the conclusion | the claim holds universally and a natural chain of deductions presents itself |
| Proof by cases | split all possibilities into finitely many situations and settle each | the objects classify naturally: odd and even; positive, negative and zero; remainders |
| Proof by contradiction | suppose the conclusion fails and derive an impossibility | the claim says something does not exist, cannot happen, or is irrational |
| Disproof by counterexample | one concrete object demolishes a universal claim | the task is to show a "for all" statement is false |
These four methods sit directly on top of the quantifier asymmetry from Arg3: universal statements are proved by the first three and refuted by counterexample, while existence statements are proved by exhibiting a single witness. The first move in recognising a proof question is therefore to see which quantifier the statement carries.
One more structural point: Paper 2 is entirely multiple choice, so you will never be asked to write a proof out in full. What is tested is recognition and audit. Which method is this argument using? What role does this particular step play within it? Is the method even applicable to this statement? Prepare accordingly: the skill to build is reading proofs critically at speed, not composing them beautifully.
08
From rearranging to error-spotting: how Paper 2 frames proof questions
Around the four proof types, the specification lists four further skills, Prf2 to Prf5, plus two items on errors in proofs. Between them they describe most of the ways Paper 2 actually frames its proof questions.
Prf2: deducing implications from given statements
You are handed premises and asked which conclusions must follow. The discipline is to accept only what is forced, never what is merely plausible.
Prf3: making conjectures from small cases, then justifying them
Compute a few small instances, spot the pattern, then judge which general claim survives scrutiny rather than assuming the pattern simply continues.
Prf4: rearranging a sequence of statements into a proof
A pure test of structural sense: knowing what each line consumes from above and what it delivers to the lines below.
Prf5: problems requiring a sophisticated chain of reasoning
The long-form composite of everything above, testing the other skills together.
Err1 and Err2: identifying errors in purported proofs
A plausible-looking argument is presented and you must locate the faulty step. The specification names two classic invalid moves itself: cancelling to pass from ab = ac to b = c (a might be zero), and passing from sin A = sin B to A = B (equal sines do not force equal angles).
For error-spotting there is a dependable routine: read line by line, asking of each step what hidden assumption carries it. Four checks come up again and again.
Division
Could the divisor be zero?
Square roots
Which branch of the sign?
Applying an inverse
Is the function actually invertible on this range?
Multiplying an inequality
Is the multiplier positive?
Purported proofs almost never fail at visible arithmetic; they fail on the line where an unstated assumption quietly stops holding.
III
Part 3 of 3
Sections 09 to 10
09
What the specification rules out: symbols and truth tables
Tucked at the end of the logic block is a note that saves a great deal of preparation time: candidates will not be expected to recognise or use symbolic notation for any of these terms, nor to complete formal truth tables. That single sentence has two practical consequences.
Logic symbols
Do not memorise
Implication arrows, quantifier symbols, conjunction and disjunction signs are simply not required
Truth tables
Do not drill
Paper 2 wants logical structure read directly inside a mathematical sentence
Formulae booklet
None provided
The mathematical toolkit is bounded by Section 1 of the specification
Time spent copying notation out of a discrete-mathematics textbook is time spent practising a skill the TMUA does not assess, and it can even add a translation step where none is needed. A truth table, meanwhile, is a machine for enumerating logical possibilities exhaustively; identifying the contrapositive of "A only if B" should come from fluency with the four conditional forms, not from tabulating cases.
Beyond a handful of definitions, the logic and proof block contains nothing to memorise; what it examines is a reading and writing habit. This is also why preparing from a university logic text is classic over-preparation: the content does not match, the depth does not match, and the same hours are far better spent on the official Notes on Logic and Proof and timed past papers.
10
Using the Notes on Logic and Proof: a four-step preparation path
UAT-UK's preparation advice for the TMUA runs to exactly three items: read the test specification, read the Notes on Logic and Proof, and answer practice papers under timed conditions. The Notes are a short official booklet written specifically for Paper 2, introduced as a first meeting with theorems and proofs for candidates who have not encountered them in their maths classes or wider reading, and they cover precisely the ground of this guide. As an introduction written from the examiners' side of the desk, they belong ahead of any third-party resource in your reading order.
01Step 1
Read Section 2 and the Notes in full
Restate each of Arg1 to Arg4 in your own words; whichever item you cannot say fluently is the gap.
02Step 2
Drill translation and negation
Rewrite statements across the four conditional forms, convert between conditional and necessary/sufficient phrasings, and negate quantified statements, all in words rather than symbols.
03Step 3
Learn the four proof types and the error routine
Annotate every proof you read line by line with what each step depends on, until critical reading becomes the default.
04Step 4
Move to timed past papers
The 2016 to 2023 papers predate the computer-based format, but the specification and question style have not changed and the official preparation page still provides them, so they remain the closest thing to the real event. With no penalty for wrong answers, build the habit of leaving nothing blank from your first timed session.
On timing: the conceptual content of logic and proof can be covered in a focused pass of two to three weeks. Everything after that is fluency, reading "which side implies which" as a reflex at the pace of twenty questions in seventy-five minutes, and that only comes from practising against the clock. FrontierVue's practice centre organises past papers by year with a timed, computer-based interface, which makes a convenient vehicle for exactly this kind of drill.
FAQ
Frequently asked questions
Does the TMUA test proof by induction?
No. Prf1 in the official specification lists exactly four proof types: direct deduction, proof by cases, proof by contradiction, and disproof by counterexample. The word induction appears nowhere in the specification or in the official Notes on Logic and Proof. Knowing induction from A level does no harm, but practising it specifically for the TMUA is misallocated time.
What is the difference between "A only if B" and "A if B"?
They point in opposite directions. "A if B" says B implies A; "A only if B" says A implies B, exactly as "if A then B" does. "Only if" states a necessary condition for A: if A has occurred, B must be in place. When both directions hold you have "A if and only if B", where each implies the other.
Do I need logic symbols or truth tables for TMUA Paper 2?
No. The specification states explicitly that candidates will not be expected to recognise or use symbolic notation for any of the logic terms, nor to complete formal truth tables. Practise in words rather than learning symbols first and translating.
What does "for some" mean in the TMUA?
The specification glosses it directly: "for some" means "for at least one", synonymous with "there exists". The statement is true provided a single object satisfies the condition, and it stays true even if every object does. Switch off the conversational reading of "some but not all".
Where do I find the Notes on Logic and Proof, and are they worth reading?
They are freely available via the TMUA preparation materials on the UAT-UK website. Written by the test owner specifically for Paper 2, they introduce theorems and proofs to candidates who have not met them before, and the official preparation advice names them explicitly. For this part of the syllabus, read them before any third-party resource.
I have never studied formal logic. Can I still prepare for Paper 2 in time?
Yes. The syllabus itself is small: four logic items, Arg1 to Arg4, plus four proof types and two error-spotting skills, and a focused conceptual pass takes two to three weeks. What separates candidates is fluency, reading implications reflexively under time pressure, and that is built through timed work on the 2016 to 2023 past papers.
Is logic and proof tested only on Paper 2?
Yes, it belongs to Paper 2 only. Both papers draw on the Section 1 mathematics, but Section 2, where logic and proof live, defines the scope of Paper 2 alone: Paper 1 tests the application of mathematical knowledge in a variety of contexts, while Paper 2 adds argument and proof on top of the same mathematics. Aim your logic practice squarely at Paper 2.
MORE GUIDES
Other TMUA preparation guides
- TMUA Paper 1: Applications of Mathematical Knowledge
- TMUA Paper 2: Mathematical Reasoning, from Syllabus to Strategy
- The TMUA Syllabus in Full: Section 1, Section 2 and Every Topic Boundary
- The TMUA revision plan: from registration to results
- TMUA time management: pacing, guessing and stamina across both papers
- TMUA Common Mistakes: Where Strong Candidates Lose Marks
- How TMUA Scoring Works: From Rasch Scaling to University Data
- TMUA test day: from arriving at the centre to reading your score
- TMUA vs MAT: After the Switch
- TMUA vs ESAT: The Course Decides, Not You
- TMUA vs STEP: One Screens, One Seals the Offer
- TMUA Registration and Test Dates for 2027 Entry
- TMUA score statistics: where you actually sit
- TMUA sittings compared: October 2025 against January 2026
- TMUA overseas candidates: the official numbers, and where they stop
- TMUA candidate numbers: how big the 2026 cohort really was
Learn it as a lesson
Where it gets hard
4 min · 4-question check · progress saved
The student version of this guide: one sitting to read, checked as soon as you finish.
FrontierVUE is an independent practice platform. It is not affiliated with or endorsed by UAT-UK, Pearson, OCR, the University of Cambridge, Imperial College London, or any official admissions-test owner.
Put it into practice
28 TMUA papers on FrontierVUE, including 10 Frontier Original mocks built to the current format, every question with a worked solution. The first 2 papers are free.