Study guide
15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
NTS Graduate Assessment Test GAT General
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GAT General Overview & Test Administration
1.1 GAT General Test Structure & Logistics 1.2 Time Management & No-Negative-Marking Strategy 1.3 GAT Test Categories & Admissions Alignment
2 Chapter 2: Verbal Reasoning — Vocabulary, Analogies & Word Roots
2.1 Verbal Analogies & Relationship Mapping 2.2 Synonyms, Antonyms & Contextual Meaning 2.3 High-Frequency NTS Vocabulary & Word Roots
3 Chapter 3: Verbal Reasoning — Sentence Completion & Reading Comprehension
3.1 Sentence Completion & Single/Double-Blank Strategies 3.2 Reading Comprehension & Textual Analysis 3.3 Essential English Grammar & Sentence Structure
4 Chapter 4: Verbal Reasoning — Grammar: Tenses, Structure & Conditionals
4.1 Tenses & Aspects I: Simple and Progressive Forms 4.2 Tenses & Aspects II: Perfect Forms, Sequence of Tenses & Voice 4.3 Parts of Speech in Depth: Articles, Prepositions & Determiners 4.4 Conditional Sentences & Hypothetical Structures
5 Chapter 5: Verbal Reasoning — Language Functions & Passage Analysis
5.1 Language Functions & Situational Appropriacy 5.2 Linking Devices, Transitions & Textual Cohesion 5.3 Main Idea, Title Selection & Topic Sentences 5.4 Types of Passage, Author's Purpose & Tone
6 Chapter 6: Quantitative Reasoning — Arithmetic & Number Theory
6.1 Number Properties, Divisibility Rules & Prime Factorization 6.2 Fractions, Decimals, Percentages & Profit-Loss Math 6.3 Ratios, Proportions, Mixtures & Work-Time Rates
7 Chapter 7: Quantitative Reasoning — Business, Consumer & Islamic Financial Mathematics
7.1 Business, Financial & Consumer Mathematics 7.2 Zakat, Ushar & Inheritance Calculations
8 Chapter 8: Quantitative Reasoning — Algebra & Equations
8.1 Algebraic Simplification, Exponent Rules & Radicals 8.2 Linear Equations, Systems & Quadratic Equations 8.3 Inequalities, Absolute Value & Function Basics
9 Chapter 9: Quantitative Reasoning — Matrices, Sequences, Sets & Functions
9.1 Matrices & Determinants 9.2 Arithmetic & Geometric Sequences 9.3 Sets, Venn Relations & Functions
10 Chapter 10: Quantitative Reasoning — Geometry & Measurement
10.1 Lines, Angles, Triangles & Pythagorean Theorem 10.2 Quadrilaterals, Polygons, Circles & Coordinate Geometry 10.3 Perimeter, Area, Surface Area & 3D Volume Calculations
11 Chapter 11: Quantitative Reasoning — Triangle Theorems, Circles & Trigonometry
11.1 Congruent Triangles, Bisectors & the Projection Rule 11.2 Circle Theorems: Chords, Tangents, Arcs & Segments 11.3 Introduction to Trigonometry
12 Chapter 12: Quantitative Reasoning — Data Interpretation & Word Problems
12.1 Data Interpretation: Tables, Bar Charts, Line Graphs & Pie Charts 12.2 Basic Statistics, Permutations, Combinations & Probability 12.3 Quantitative Word Problems & Age/Coin/Venn Diagram Scenarios
13 Chapter 13: Analytical Reasoning — Fundamentals & Ordering Games
13.1 Analytical Reasoning Framework & Diagramming Notation 13.2 Linear Sequencing, Ranking & Slot-Based Puzzles 13.3 Circular Seating Arrangements & Spatial Relative Puzzles
14 Chapter 14: Analytical Reasoning — Grouping, Selection & Matrix Games
14.1 Grouping, Distribution & Bin-Assignment Puzzles 14.2 Selection Games & Team Formation Constraints 14.3 Attribute Matching & Multi-Dimensional Grid Puzzles
15 Chapter 15: Analytical Reasoning — Critical & Deductive Logic
15.1 Logical Arguments, Premise-Conclusion Structure & Unstated Assumptions 15.2 Strengthening, Weakening & Evaluating Logical Arguments 15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
16 Chapter 16: Analytical Reasoning — Inductive Logic & Causal Inference
16.1 Inductive Logic, Generalisation & Causal Reasoning
15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
Key Takeaways Explain This Topic AI
Deductive logic yields strictly necessary conclusions: if the premises are accepted as true, the conclusion must be true in all possible valid cases.
Categorical syllogisms evaluate set relationships using universal ('All', 'No') and particular ('Some', 'Some are not') quantifiers.
In formal logic, the quantifier 'Some' strictly means 'at least one' (and potentially all), rather than 'some but not all'.
Valid conditional inferences follow Modus Ponens (If P then Q; P => Q) or Modus Tollens (If P then Q; ~Q => ~P); the Contrapositive (~Q => ~P) is logically equivalent to the original rule.
Knights and Knaves (Truth/Lie) scenario puzzles are solved by systematically applying the Method of Hypotheses and eliminating cases that generate logical contradictions.
Last updated: August 2026
Formal Deductions, Syllogisms & Scenario-Based Inferences
While critical reasoning focuses on argument evaluation, probability, and evidence strength, formal deductive logic deals with absolute certainty. In a valid deductive structure, if the premises are accepted as true, the conclusion must follow necessarily—it is logically impossible for the premises to be true while the conclusion is false. On the NTS GAT General, deductive logic appears in two main formats: categorical syllogisms and conditional scenario inferences (including Truth/Lie puzzles) .
Categorical Syllogisms & Set Theory Relationships
A categorical syllogism is a formal deductive argument consisting of two premises and a conclusion that assert or deny relationships between categories (sets). Categorical statements utilize four standard forms:
Categorical Type Standard Logical Form Set Theory Representation Venn Diagram Visualizing Set Relationship
Universal Affirmative (A) All X X X are Y Y Y Set X X X is a subset of Set Y Y Y ( X ⊆ Y X \subseteq Y X ⊆ Y ) Circle X X X lies entirely inside Circle Y Y Y
Universal Negative (E) No X X X is Y Y Y Sets X X X and Y Y Y are disjoint ( X ∩ Y = ∅ X \cap Y = \emptyset X ∩ Y = ∅ ) Circles X X X and Y Y Y have zero overlap
Particular Affirmative (I) Some X X X are Y Y Y At least one element exists in X ∩ Y X \cap Y X ∩ Y An X mark is placed in the intersection of X X X and Y Y Y
Particular Negative (O) Some X X X are not Y Y Y At least one element in X X X lies outside Y Y Y An X mark is placed inside X X X but outside Y Y Y
Critical Logical Definition: In formal logic, the quantifier "Some" means "at least one" (and potentially up to all). It does not imply "some but not all". If "All X X X are Y Y Y " is true, then "Some X X X are Y Y Y " is also mathematically true!
Syllogism Validity Rules & Venn Diagram Verification
To determine whether a syllogistic conclusion is valid on the NTS exam:
Universal Necessity: A conclusion is valid only if it holds true in every single possible Venn diagram arrangement consistent with the premises. If you can draw even one valid diagram configuration where the conclusion fails, the conclusion is INVALID .
The Particularity Trap: You cannot derive a particular conclusion ("Some") strictly from two universal premises ("All" or "No") unless an explicit existential premise asserts that the set is non-empty.
Negative Premise Alignment: If either premise is negative ("No" or "Some are not"), any valid conclusion must also be negative.
Formal Conditional Logic & Immediate Inferences
Conditional statements form the backbone of analytical logic puzzles. A conditional rule takes the standard form If P P P , then Q Q Q ( P → Q P \rightarrow Q P → Q ), where P P P is the antecedent (sufficient condition) and Q Q Q is the consequent (necessary condition).
Valid Inferences vs. Invalid Fallacies
Given the true conditional rule P → Q P \rightarrow Q P → Q ( "If a candidate scores above 70 on GAT ( P P P ), then they receive a scholarship ( Q Q Q )" ):
- Formal Inference Name Given Information Inferred Conclusion Logical Validity Explanation & Real-World Context
- Original Rule P → Q P \rightarrow Q P → Q If P P P , then Q Q Q GIVEN TRUE Premise rule
Modus Ponens P P P is True Conclude Q Q Q is True VALID Candidate scored 72 → \rightarrow → Candidate receives scholarship
Modus Tollens Q Q Q is False ( ¬ Q \neg Q ¬ Q ) Conclude P P P is False ( ¬ P \neg P ¬ P ) VALID Candidate did not receive scholarship → \rightarrow → Scored ≤ 70 \le 70 ≤ 70
Contrapositive ¬ Q → ¬ P \neg Q \rightarrow \neg P ¬ Q → ¬ P If not Q Q Q , then not P P P VALID Logically identical to original rule
Converse Fallacy Q Q Q is True Conclude P P P is True INVALID Candidate got scholarship → \rightarrow → Must have scored > 70 >70 > 70 (False: could have received athletic waiver)
Inverse Fallacy P P P is False ( ¬ P \neg P ¬ P ) Conclude Q Q Q is False ( ¬ Q \neg Q ¬ Q ) INVALID Candidate scored 65 → \rightarrow → Gets no scholarship (False: ignores alternative funding rules) Fundamental Logical Equivalence: ( P → Q ) ≡ ( ¬ Q → ¬ P ) \text{Fundamental Logical Equivalence: } (P \rightarrow Q) \equiv (\neg Q \rightarrow \neg P) Fundamental Logical Equivalence: ( P → Q ) ≡ ( ¬ Q → ¬ P )
Multi-Step Conditional Chains
When multiple conditional rules are linked ( P → Q P \rightarrow Q P → Q and Q → R Q \rightarrow R Q → R ), you can form a valid conditional chain : Chain Rule: ( P → Q ) ∧ ( Q → R ) ⟹ ( P → R ) \text{Chain Rule: } (P \rightarrow Q) \land (Q \rightarrow R) \implies (P \rightarrow R) Chain Rule: ( P → Q ) ∧ ( Q → R ) ⟹ ( P → R )
The contrapositive of the entire chain is equally valid: ¬ R → ¬ P \neg R \rightarrow \neg P ¬ R → ¬ P .
Truth/Lie Analytical Scenario Puzzles
NTS GAT Analytical Reasoning features scenario puzzles involving individuals who belong to specific truth-telling categories: Knights (who ALWAYS speak the truth) and Knaves (who ALWAYS lie) .
The Method of Hypotheses (Proof by Contradiction)
To solve Truth/Lie puzzles systematically under exam pressure:
Select a Target Character: Identify a speaker whose statement makes an assertion about their own identity or another participant's identity.
Assume Case 1 (Truth-Teller): Assume Person A is a Knight (tells the truth).
Treat Person A's statement as factual truth.
Deduce the identities of other characters based on that statement.
Search for logical contradictions (e.g., a Knight uttering a false statement, or a Knave making a true statement).
If a contradiction arises, REJECT Case 1 .
Assume Case 2 (Liar): Assume Person A is a Knave (always lies).
Treat Person A's statement as false (negate its content).
Deduce the resulting identities.
Check for logical contradictions.
Identify the Unique Consistent Model: The assignment of identities that produces zero logical contradictions is the definitive correct solution.
- Step-by-Step Worked NTS Scenarios
- Worked Scenario 1: Syllogistic Chain Deduction
Premises:
- All research fellows are data analysts. ( R ⊆ D R \subseteq D R ⊆ D )
- Some data analysts are econometricians. ( D ∩ E ≠ ∅ D \cap E \neq \emptyset D ∩ E = ∅ )
- No econometricians are careless observers. ( E ∩ C = ∅ E \cap C = \emptyset E ∩ C = ∅ )
Evaluation of Conclusions:
Conclusion 1: No research fellows are careless observers.
Analysis: INVALID . Research fellows ( R R R ) are inside Data Analysts ( D D D ). Econometricians ( E E E ) overlap with D D D . Econometricians ( E E E ) have zero overlap with Careless Observers ( C C C ). However, R R R could either overlap with C C C or be separate from C C C . It is not strictly necessary.
Conclusion 2: Some data analysts are not careless observers.
Analysis: VALID . Premise 2 states that some data analysts belong to the set of econometricians. Premise 3 states that no econometrician is a careless observer. Therefore, those specific data analysts who are econometricians cannot be careless observers! They guarantee that "Some data analysts are not careless observers."
Worked Scenario 2: Truth/Lie Island Puzzle
Scenario Prompt:
On a remote island, every inhabitant is either a Knight (who always tells the truth) or a Knave (who always lies). You meet two inhabitants, Amir and Tariq. Amir states: "At least one of us is a Knave." What are the true identities of Amir and Tariq?
Systematic Hypothesis Resolution:
Hypothesis 1: Assume Amir is a Knave (Liar).
If Amir is a Knave, his statement must be FALSE .
Amir's statement is "At least one of us is a Knave."
The logical negation of "At least one is a Knave" is "Neither of us is a Knave" (meaning Both are Knights ).
But if both are Knights, then Amir must be a Knight!
Contradiction: We assumed Amir is a Knave, but the logic forces Amir to be a Knight. Therefore, Hypothesis 1 is IMPOSSIBLE .
Hypothesis 2: Assume Amir is a Knight (Truth-Teller).
If Amir is a Knight, his statement must be TRUE .
Amir's statement "At least one of us is a Knave" is therefore true.
Since Amir is a Knight (not a Knave), the other person, Tariq, MUST be a Knave to satisfy the truth of Amir's statement!
Consistency Check: Amir is a Knight (telling the truth that at least one is a Knave), and Tariq is a Knave. No contradiction exists!
Final Conclusion: Amir is a Knight, and Tariq is a Knave.