Logical Reasoning Formula Sheet and Short Notes
One-page CSIR NET Part A revision: conditionals, syllogisms, liars, series rules, letter codes, puzzle method, rankings, directions, calendars, dice, figures.
- 6 min
On this page · 6 sections
Every rule and trap from Statements, Syllogisms and Arguments, Number, Letter and Pattern Series, Arrangements, Rankings and Scheduling and Directions, Relations, Calendars and Figures, on one page.
Part A in one table
Per the NTA information bulletin for December 2026, the same for all five subjects:
| Given | Attempt | Correct | Wrong | Maximum |
|---|---|---|---|---|
| 20 | 15 | +2 | −0.5 | 30 |
Only the first 15 answered questions are evaluated. Details on the General Aptitude overview.
Logical reasoning
| Idea | Rule |
|---|---|
| \( P \to Q \) is false | only when P true, Q false |
| Equivalent | contrapositive \( \lnot Q \to \lnot P \); also \( \lnot P \lor Q \) |
| Not equivalent | converse \( Q \to P \); inverse \( \lnot P \to \lnot Q \) |
| P only if Q | \( P \to Q \) (Q necessary, P sufficient) |
| P unless Q | \( \lnot Q \to P \) = P or Q |
| Valid | modus ponens, modus tollens, chain, disjunctive syllogism |
| Invalid | affirming the consequent, denying the antecedent |
| Statement | Negation |
|---|---|
| All A are B | Some A are not B |
| No A is B | Some A are B |
| Some A are B | No A is B |
| P and Q / P or Q | not P or not Q / not P and not Q |
| If P then Q | P and not Q |
Syllogisms. “Some” = at least one, possibly all. Safe conversions: Some A–B ↔ Some B–A; No A–B ↔ No B–A; All A are B → Some B are A.
| Premises (A–B, B–C) | Conclusion |
|---|---|
| All + All | All A are C |
| All + No | No A is C |
| Some + All | Some A are C |
| Some + No | Some A are not C |
| No + All, No + Some | Some C are not A |
| All + Some, Some + Some, No + No | none |
- Either I or II: same subject and predicate, I–E or A–O pair.
- Follows = true in every diagram; possible = true in at least one.
- Liars: “X says Y lies” → opposite types; “X says Y is truthful” → same type; nobody says “I am a liar”. In count puzzles, find two contradicting statements first.
- Arguments: check for common cause, reverse causation and selection before accepting “A causes B”.
Series formation
Order of checks: Differences → Ratios → Known numbers → Interleaved → Fibonacci-type → digits.
| Signal | Try | Example |
|---|---|---|
| Slow growth | first, then second differences | 1, 3, 8, 18, 35 → 61 |
| Fast growth | ratios, × k ± c | 4, 9, 19, 39, 79 → 159 |
| Near squares or cubes | \( n^2 \pm 1 \), \( n(n+1) \), \( n^3 - n \) | 0, 6, 24, 60, 120 → 210 |
| Up and down | odd and even positions separately | 1, 3, 4, 9, 7, 27, 10 → 81 |
| Each near sum of previous | Fibonacci-type | 1, 1, 2, 4, 7, 13 → 24 |
| One term off | it spoils two differences | 3, 7, 15, 31, 64, 127 |
- Constant second differences → quadratic; constant third → cubic.
- Letters: EJOTY = 5, 10, 15, 20, 25; opposites sum to 27 (A–Z, M–N); wrap after Z.
- Codes: derive the rule from the example; substitution codes are answered in the code’s words.
- Analogies, odd one out, grids: find the property, test every option.
Puzzles
Clue order: Fixed → Block → Relative → Negative; one drawing per case; check every clue at the end.
| Setting | Rule |
|---|---|
| Row facing north / south | their right = your right / your left |
| Circle facing the centre | left = clockwise, right = anticlockwise |
| Opposite seat (n even) | \( k + n/2 \) |
| “Two people between” | seat gap of 3 |
| Round-table seatings | \( (n-1)! \); necklace \( (n-1)!/2 \) |
| Rank | total = from top + from bottom − 1; between = \( \lvert a - b \rvert - 1 \) |
| Undetermined | answer only what every surviving case shares |
- Jugs: measurable amounts are multiples of \( \gcd(a, b) \) up to \( \max(a, b) \).
- River crossings: the key move is a return trip carrying something back (farmer–wolf–goat–cabbage: 7 crossings).
Analytical reasoning
$$\boxed{\text{Distance} = \sqrt{(\text{net E})^2 + (\text{net N})^2}}$$- Right turn = clockwise: N → E → S → W. Morning shadow → west; evening shadow → east.
- Relations: tree by generation (+2 grandparents … −2 grandchildren); never assume gender.
| Calendar | Odd days |
|---|---|
| Ordinary / leap year | 1 / 2 |
| 100 / 200 / 300 / 400 years | 5 / 3 / 1 / 0 |
| Months (ordinary year) | 3 0 3 2 3 2 3 3 2 3 2 3 |
| Day code | 0 Sun, 1 Mon, 2 Tue, 3 Wed, 4 Thu, 5 Fri, 6 Sat |
- Leap year: divisible by 4; century years only if divisible by 400 (1900 no, 2000 yes).
- Mirror clock: 11:60 − time (actual + mirror = 12:00).
- Dice: same face in the same position in two views, other faces all different → matching positions are opposite; adjacent faces are never opposite; “opposites sum to 7” only for a standard die.
- Nets: in a row, faces one apart are opposite; in a cross, the faces above and below the row of four are opposite.
- Painted \( n^3 \) cube: 8 corners, \( 12(n-2) \) edges, \( 6(n-2)^2 \) faces, \( (n-2)^3 \) hidden.
| Figure | Count |
|---|---|
| \( k \) lines from one vertex of a triangle | \( \binom{k+2}{2} \) triangles |
| Squares in \( n \times n \) | \( \sum k^2 \) (4 × 4: 30; 8 × 8: 204) |
| Rectangles in \( m \times n \) | \( \binom{m+1}{2}\binom{n+1}{2} \) (4 × 4: 100) |
Data sufficiency: test I alone, II alone, then together; two possible values means not sufficient; do not solve further than needed.
Where to go next
- Back to the chapter overview.
- The arithmetic half of Part A: Numerical Ability: Quick Revision.