Syllogism questions can become confusing when several statements look almost identical.
The difficulty is usually not complicated mathematics or specialist knowledge. It is keeping track of exactly what words such as all, some and no allow you to conclude.
That is why guessing based on what “sounds right” can be unreliable.
Current format note: As of November 2026, UCAT lists Decision Making as 35 questions in 37 minutes. Some Decision Making questions have a single answer, while others require candidates to respond Yes or No to five statements. UCAT also notes that its current preparation information applies to the 2026 testing cycle and may change for 2027, so candidates should recheck the official format when updated information is released.
Official UCAT Decision Making materials include questions that require candidates to apply logic and decide whether conclusions follow from the information provided.
You do not need specialist logical terminology to approach them. What matters is whether a conclusion must follow from the statements provided.
This tutorial uses progressively harder original examples to show how to:
All examples below were created for instructional practice. They are not official UCAT questions, recalled test material or predictions of future UCAT content.
Before solving a syllogism, identify the words that control the relationship.
Four patterns are especially useful.
Every member of A belongs to B.
If something is A, it must also be B.
However:
All A are B
does not mean:
All B are A.
The relationship only works in the direction given.
Figure 1. All A are B. Every A is B, but this does not mean all B are A.
Some A are B means that at least one A is also B.
Importantly, this does not tell us whether only some or all A are B.
Because at least one member belongs to both sets, we can also say:
Some B are A.
But we cannot conclude:
All A are B
or:
All B are A.
Figure 2. Some A are B. The X represents at least one member that belongs to both A and B.
The two groups cannot share a member.
If something is A, it cannot also be B.
The relationship works in both directions: if no A are B, then no B are A.
This means:
At least one A lies outside B.
It does not tell us where every other A is located.
Some of the remaining A members could be B, or none of them could be. The statement alone does not decide that.
Do not replace a qualifier with a stronger one.
For example:
Some A are B
does not become:
Most A are B
and it certainly does not become:
All A are B.
A useful first step in UCAT syllogisms is therefore:
Identify the qualifier before testing the conclusion.
A conclusion is supported when it has to be true if the original statements are true.
It is not enough for the conclusion to be possible.
Consider:
All R are S.
No S are T.
Is this conclusion supported?
No R are T.
Start with the first statement.
All R are S, so anything that belongs to R must also belong to S.
Now apply the second statement:
No S are T.
Nothing in S can belong to T.
Because every R is already inside S, no R can be T either.
Conclusion: Supported.
The reasoning can be reduced to:
R → S
and:
S cannot overlap T
therefore:
R cannot overlap T.
The conclusion does not add a new assumption. It follows directly from the two statements.
Now consider:
Some P are Q.
All Q are R.
Which conclusion is supported?
A. All P are R.
B. Some P are R.
C. No P are R.
D. All R are P.
The first statement guarantees at least one member that is both P and Q.
The second statement tells us that every Q is R.
Therefore, the member that is both P and Q must also be R.
So:
Some P are R.
is supported.
A. All P are R
The information only guarantees something about the P member or members that are also Q. Other P members could lie outside R.
C. No P are R
This contradicts what we have established: at least one P is Q, and every Q is R.
D. All R are P
This reverses and expands the relationship. Knowing that all Q are R does not mean all R are Q or P.
The valid chain is:
some P → Q → R
therefore:
some P → R.
This is an important pattern to recognize in UCAT syllogisms.
Diagrams can help when the statements involve:
They are especially useful when the wording starts to become difficult to track.
But a diagram should reduce uncertainty, not become an extra task.
Consider:
No L are M.
Some N are M.
All N are P.
Which conclusion is supported?
A. No P are L.
B. Some P are not L.
C. All P are M.
D. Some L are P.
Start with:
Some N are M.
This guarantees at least one member that is both N and M.
We also know:
All N are P.
So that same member must also belong to P.
It is therefore:
N + M + P
Now use:
No L are M.
Anything in M cannot be L.
Our guaranteed member is in M, so it cannot belong to L.
Therefore:
Some P are not L.
Correct answer: B.
Figure 3. Following the guaranteed member. X is in both N and M. Because all N are P, X is also in P. Because no L are M, X cannot be L. Therefore, some P are not L.
No P are L.
We have proved something only about the P member that is also N and M.
Other P members could be L.
All P are M.
All N are P, but we do not know that all P are N or M.
Some L are P.
Nothing guarantees an L–P overlap.
It may be possible, but possible is not the same as supported.
Some chains can be handled quickly without a diagram.
For example:
All A are B.
All B are C.
Then:
All A are C.
follows directly as:
A → B → C
Use a diagram when it reduces uncertainty. You do not need to draw one for every question.
Most mistakes in UCAT syllogisms come from a few repeatable reasoning errors.
Rule:
All A are B
does not mean:
All B are A.
All of A can be inside B without all of B being inside A.
Rule:
Some A are B
guarantees at least one shared member.
It does not justify:
All A are B.
Do not strengthen the qualifier beyond what the statement provides.
Suppose:
All H are J.
Some K are J.
Can we conclude:
Some K are H?
No.
The K members could overlap H, but they could also lie elsewhere within J. Since both arrangements are possible, the conclusion is not guaranteed.
From:
Some N are M.
All N are P.
we can conclude:
Some P are M.
But not:
All P are M.
The evidence guarantees only that at least one P is M.
Words such as no, not and none can completely change the relationship.
If:
No A are B
then a guaranteed A member cannot also be placed in B.
Check negative qualifiers before combining statements.
Suppose:
All painters are engineers.
Some engineers are musicians.
Whether this sounds realistic is irrelevant.
For the logic task, treat the statements as true and reason only from the information given.
Now try a short set in a format closer to the multiple-statement questions used within UCAT Decision Making.
Read the statements once, then decide Yes if each conclusion must follow and No if it does not.
All A are B.
No B are C.
Some D are A.
| Conclusion | Yes or No? |
|---|---|
| 1. No A are C. | ? |
| 2. Some D are B. | ? |
| 3. Some D are not C. | ? |
| 4. All B are A. | ? |
| 5. Some C are D. | ? |
Try all five before checking the answers.
1. No A are C — YES
All A are B, and no B are C.
Therefore, anything that is A cannot be C.
2. Some D are B — YES
Some D are A.
Because all A are B, those D members must also be B.
3. Some D are not C — YES
The guaranteed D members are A, so they are also B.
No B are C.
Therefore, those D members cannot be C.
4. All B are A — NO
This reverses:
All A are B.
Nothing tells us that every B must also be A.
5. Some C are D — NO
The statements do not guarantee any C–D overlap.
It might be possible for other D members to be C, but possibility is not enough.
| If you missed... | Check whether you are struggling with... |
|---|---|
| Question 1 | Following a chain into an exclusion |
| Question 2 | Carrying a guaranteed member through an implication |
| Question 3 | Combining some with a negative relationship |
| Question 4 | Reversing an all statement |
| Question 5 | Treating something possible as guaranteed |
A score such as 3/5 tells you how many mistakes you made.
The pattern tells you what to work on next.
After practice, classify the reason for each mistake.
| Error type | Question to ask next time |
|---|---|
| Reversal | Did I reverse “All A are B”? |
| Qualifier error | Did I change some into all, or may into must? |
| Possibility error | Is the conclusion guaranteed or merely possible? |
| Chain error | Did I follow every link in the relationship? |
| Negative-statement error | Did I miss a no or not? |
| Diagram error | Does my sketch show only what the statements justify? |
| Outside-knowledge error | Did I introduce a real-world assumption? |
Instead of simply recording wrong, record why it was wrong.
That makes repeated weaknesses easier to identify.
UCAT Decision Making is time-limited, but speed should not come at the cost of logical accuracy.
Use two short rounds of comparable UCAT syllogisms.
For each question:
Record your accuracy and your error type.
Complete a similar set under time pressure.
Then compare the two rounds.
Ask:
Did I become faster because I recognized the relationships more quickly, or because I started guessing?
If speed improves but reversal, qualifier or possibility errors increase, the problem is not yet timing. It is reasoning accuracy.
For a broader plan covering the other subtests, diagnostics and timed practice, see Icon Education’s How to Prepare for the UCAT.
The most useful question in a UCAT syllogism is not:
“Does this conclusion sound reasonable?”
It is:
“Must this conclusion be true if the statements are true?”
Start with the qualifiers:
all / some / no / not
Then:
translate the relationships → follow the chain → draw only when useful → test whether the conclusion is guaranteed
Watch especially for:
When reviewing UCAT syllogisms, classify the reasoning error rather than simply recording whether an answer was right or wrong.
That turns syllogism practice from guessing into recognizing repeatable logical structures.
Get focused support for UCAT Decision Making.