Study guide
5.2 Deductive Reasoning: Categorical Logic, Syllogisms, and Conditionals
Common Recruitment Examination CRE
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: CRE Structure, Eligibility, Administration, and the BLNST
1.1 What the CRE Is, Who Can Sit It, and Which Grades Need It 1.2 Paper Formats, Grading, Equivalent Results, and Result Certificates 1.3 Sittings, Applications, Exam-Day Rules, and Pacing 1.4 The BLNST, Your Results, and What Happens After the CRE
2 Chapter 2: Use of English — Reading Comprehension
2.1 Reading Strategy, Gist Identification, and Passage Architecture 2.2 Detail Retrieval, Drawing Inferences, and Author Tone 2.3 Vocabulary in Context, Nuance, and Figurative Language
3 Chapter 3: Use of English — Error Identification & Grammar Foundations
3.1 Grammatical Errors: Subject-Verb Agreement, Tense, and Mood 3.2 Syntax Errors: Misplaced Modifiers, Parallelism, and Prepositions 3.3 Lexical and Stylistic Errors: Diction, Redundancy, and Word Choice
4 Chapter 4: Use of English — Sentence Completion & Paragraph Improvement
4.1 Sentence Completion: Structural Connectives, Subordinate Clauses, and Collocations 4.2 Paragraph Improvement: Cohesion, Flow, and Sentence Combining 4.3 Paragraph Improvement: Revision for Conciseness, Tone, and Clarity
5 Chapter 5: Aptitude Test — Verbal & Deductive Reasoning
5.1 Verbal Reasoning: True, False, and Cannot Tell Methodology 5.2 Deductive Reasoning: Categorical Logic, Syllogisms, and Conditionals 5.3 Relational Logic, Sequencing, and Analytical Elimination
6 Chapter 6: Aptitude Test — Data Sufficiency & Numerical Reasoning
6.1 Data Sufficiency: The CRE Two-Clue Format 6.2 Data Sufficiency: Hidden Anchors, Redundant Clues, and Other Traps 6.3 Numerical Reasoning: Arithmetic, Geometric, and Multi-Tier Sequences
7 Chapter 7: Aptitude Test — Interpretation of Tables & Graphs
7.1 Statistical Tables: Rapid Extraction, Percentages, and Proportions 7.2 Bar Charts, Line Graphs, and Trend Extrapolation 7.3 Multi-Data Synthesis, Composite Tables, and Common Distractors
8 Chapter 8: Use of Chinese — Reading Comprehension and Character Recognition (閱讀理解與字詞辨識)
8.1 Use of Chinese: Article Reading (文章閱讀) 8.2 Use of Chinese: Short Extract Reading (片段╱語段閱讀) 8.3 Use of Chinese: Wrongly Written Characters (字詞辨識:錯別字) 8.4 Use of Chinese: Matching Simplified and Traditional Characters (字詞辨識:簡化字)
9 Chapter 9: Use of Chinese — Sentence Analysis and Usage (句子辨析與詞句運用)
9.1 Use of Chinese: Structural Sentence Errors (句子辨析:語病) 9.2 Use of Chinese: Logical Errors and Ambiguity (句子辨析:邏輯錯誤與歧義) 9.3 Use of Chinese: Near-Synonyms and Word Choice (詞句運用:詞語選用) 9.4 Use of Chinese: Idioms, Connectives, and Polite Forms (詞句運用:成語、關聯詞與敬謙辭) 9.5 Use of Chinese: Sentence Filling and Sentence Ordering (詞句運用:句子填充與排序)
5.2 Deductive Reasoning: Categorical Logic, Syllogisms, and Conditionals
Key Takeaways Explain This Topic AI
The Aptitude Test's 演繹推理 (Deductive Reasoning) part has 8 questions set in Chinese, each asking for the inference, or set of inferences, that must follow from a short passage assumed to be true.
In formal logic, the quantifier 'Some' strictly means 'at least one, and possibly all'; it does not imply 'some but not all' as it does in everyday conversation.
The Law of the Contrapositive ( P → Q ⟺ ¬ Q → ¬ P P \rightarrow Q \iff \neg Q \rightarrow \neg P P → Q ⟺ ¬ Q → ¬ P ) is the single most vital deduction tool: if a conditional statement is true, its contrapositive is always identically true.
Affirming the consequent and denying the antecedent are both invalid, so a correct inference never runs a conditional rule backwards.
In Chinese deductive items, 只要……就…… marks a sufficient condition, 只有……才…… marks a necessary condition, and 除非 P,否則 Q means 'if not P, then Q'.
Last updated: October 2026
5.2 Deductive Reasoning: Categorical Logic, Syllogisms, and Conditionals
Quick Answer: The Aptitude Test's 8 Deductive Reasoning (演繹推理) questions are set in Chinese. Each gives a short passage that you must assume is true and asks for the inference, or set of inferences, that must follow. Key competencies include: (1) evaluating categorical syllogisms via Euler/Venn diagrams while remembering that some means at least one, possibly all ; (2) applying the contrapositive rule ( P → Q ⟺ ¬ Q → ¬ P P \rightarrow Q \iff \neg Q \rightarrow \neg P P → Q ⟺ ¬ Q → ¬ P ) across chained conditionals; (3) rejecting invalid inferences generated by Affirming the Consequent ( Q → P Q \rightarrow P Q → P ) or Denying the Antecedent ( ¬ P → ¬ Q \neg P \rightarrow \neg Q ¬ P → ¬ Q ); and (4) translating administrative directives where if marks sufficiency, only if marks necessity, and unless establishes a negated antecedent ( ¬ B → A \neg B \rightarrow A ¬ B → A ).
The Architecture of Deductive Reasoning
Unlike Verbal Reasoning—which evaluates factual adherence to an informational text— Deductive Reasoning (演繹推理) tests formal, structural validity. In deductive logic, if the stated premises are assumed to be true, the valid conclusion must be true by necessity . The truth of the premises guarantees the truth of the conclusion; there is no room for probability, induction, or real-world plausibility.
On the CRE Aptitude Test, the 8 Deductive Reasoning items are set in Chinese (the English Verbal Reasoning items are covered in Section 5.1). The CSB's directions read: 「請根據以下短文的內容,選出一個或一組推論。請假定短文的內容都是正確的。」 That is: based on the passage, choose one inference or a set of inferences, and assume everything in the passage is true. The logic involved includes:
Categorical Syllogisms : Deductions based on set inclusions and exclusions ( all , no , some , some... not ).
Conditional Reasoning : Logical implications involving if... then , only if , unless , and if and only if .
Chained Deductions : Multi-step relational chains where three or four regulatory conditions must be linked together to evaluate an individual case.
The Official Sample and Chinese Logic Words
The CSB's sample:
- 龍門鎮中的每一個人都是亞華的親戚,亞華只有一個兒子,銘希在龍門鎮裡生活,志南是亞華的丈夫。由此可推論:
- A 銘希是亞華的女兒。 B 亞華生活在龍門鎮裡。 C 銘希是亞華的親戚。 D 志南生活在龍門鎮裡。
- 答案:C
C follows: everyone in the town is Ah Wa's relative (所有 S 都是 P), and Ming Hei lives in the town (Ming Hei is S), so Ming Hei is Ah Wa's relative.
A does not follow: being a relative does not make Ming Hei a daughter.
B and D do not follow: the passage says people in the town are relatives; it does not say relatives live in the town. Inferring that Ah Wa or her husband lives there reverses the rule (所有 S 是 P does not give 所有 P 是 S).
Because the items are in Chinese, translate each logic word into its formal meaning before testing the options:
- Chinese wording Formal meaning Note
- 所有/凡是/每一個……都…… All S are P Cannot be reversed
- 所有……都不……/沒有……是…… No S are P Can be reversed: no P are S
- 有些/有的……是…… Some S are P At least one, possibly all
- 有些……不是…… Some S are not P Does not imply some S are P
- 如果/只要 P,就 Q P → Q (P is sufficient) Contrapositive: 非 Q → 非 P
- 只有 P,才 Q Q → P (P is necessary) Do not read it as P → Q
- 除非 P,否則 Q 非 P → Q 除非 P,否則不 Q is the same as 只有 P,才 Q
- 當且僅當 P ↔ Q Both directions hold
- 或者 P,或者 Q At least one of P and Q Both may be true
- 要麼 P,要麼 Q Exactly one of P and Q Not both
- 並非所有 S 都是 P Some S are not P Negating "all" gives "some ... not"
- 並非有些 S 是 P No S are P Negating "some" gives "none"
When an item offers sets of inferences (for example, "(1) and (3) only"), test each numbered inference separately and then pick the option that lists exactly the valid ones.
Categorical Logic: Aristotle's Four Standard Forms
Categorical logic deals with relationships between categories or classes of objects. Every categorical proposition connects a Subject class ( S S S ) with a Predicate class ( P P P ) through one of four standard structures established in classical logic:
Type Designation Standard Phrasing Set-Theoretic Definition Venn / Euler Representation
A Universal Affirmative All S are P S ⊆ P S \subseteq P S ⊆ P The entire circle of S S S is drawn completely inside P P P .
E Universal Negative No S are P S ∩ P = ∅ S \cap P = \emptyset S ∩ P = ∅ Circle S S S and Circle P P P are completely separated (disjoint).
I Particular Affirmative Some S are P S ∩ P ≠ ∅ S \cap P \neq \emptyset S ∩ P = ∅ Circle S S S and Circle P P P overlap by at least one member.
O Particular Negative Some S are not P S ∖ P ≠ ∅ S \setminus P \neq \emptyset S ∖ P = ∅ At least one member of S S S lies outside Circle P P P .
The Crucial "Some" Distinction in Formal Logic
In everyday English and Cantonese conversation, using the word "some" carries a conversational implicature of limitation: if someone says "Some committee members attended the briefing" , listeners naturally infer that not all members attended.
Important
The "Some" Trap: In formal deductive logic, "Some" means "at least one, and potentially all" . It guarantees an existential lower bound of one member, but it does not establish an upper bound. The statement "Some Senior Engineers are HKIE Fellows" is entirely compatible with the possibility that all Senior Engineers are HKIE Fellows. Never conclude that "Some S are not P" merely because you were told that "Some S are P" .
Testing Syllogisms with Euler Diagrams
A categorical syllogism consists of two premises (Major and Minor) and a conclusion connecting three terms: the Major Term, the Minor Term, and the Middle Term (which appears in both premises but never in the conclusion).
To test whether a syllogistic deduction is valid under CRE exam conditions:
Draw the spatial relationships of the premises using overlapping circles ( Euler diagrams ).
Attempt actively to construct a counterexample diagram —a valid configuration of the circles that satisfies both premises but falsifies the candidate conclusion.
The Golden Rule of Deductive Validity: A conclusion is valid if and only if it holds true across every single possible Euler diagram configuration . If even one valid spatial arrangement violates the conclusion, the deduction is invalid.
The Fallacy of the Undistributed Middle
Consider this classic syllogistic error:
Premise 1: All Administrative Officers are degree holders ( A ⊆ D A \subseteq D A ⊆ D ).
Premise 2: All Town Planners are degree holders ( T ⊆ D T \subseteq D T ⊆ D ).
Candidate Conclusion: All Administrative Officers are Town Planners ( A ⊆ T A \subseteq T A ⊆ T ).
Euler Analysis: Circle A A A is inside Circle D D D . Circle T T T is also inside Circle D D D . However, Circle A A A and Circle T T T can be completely separate from each other while both remaining inside D D D . Because an arrangement exists where A ∩ T = ∅ A \cap T = \emptyset A ∩ T = ∅ , the conclusion is invalid . The middle term ( degree holders ) was never "distributed" across the entire class in a way that forces A A A and T T T to touch.
Loading diagram... Formal Deductive Logic: Valid Inferences vs Classical Fallacies
Conditional Logic: The Law of the Contrapositive
Conditional statements govern the vast majority of civil service regulations, legal codes, and administrative criteria. A standard conditional is expressed as: If P , then Q ( P → Q ) \text{If } P \text{, then } Q \quad (P \rightarrow Q) If P , then Q ( P → Q ) Where:
P P P is the Antecedent (the condition or trigger).
Q Q Q is the Consequent (the guaranteed result or required property).
The Four Forms of Conditional Inference
Given the rule P → Q P \rightarrow Q P → Q :
Modus Ponens (Affirming the Antecedent - VALID):
Given: P P P is True.
Deduction: Therefore, Q Q Q must be True.
Example: "If an application is submitted late, it is rejected. Application X was submitted late. Therefore, Application X is rejected."
Modus Tollens (Denying the Consequent - VALID):
Given: Q Q Q is False ( ¬ Q \neg Q ¬ Q ).
Deduction: Therefore, P P P must be False ( ¬ P \neg P ¬ P ).
Example: "Application Y was not rejected. Therefore, Application Y was not submitted late."
Fallacy of Affirming the Consequent (INVALID):
Given: Q Q Q is True.
Faulty Deduction: Therefore, P P P must be True. (ERROR)
Why it fails: An application could be rejected for another reason, such as missing documents. Knowing the result Q Q Q occurred does not prove it was triggered by P P P .
Fallacy of Denying the Antecedent (INVALID):
Given: P P P is False ( ¬ P \neg P ¬ P ).
Faulty Deduction: Therefore, Q Q Q must be False ( ¬ Q \neg Q ¬ Q ). (ERROR)
Why it fails: Denying the specific condition P P P does not prevent Q Q Q from occurring via an alternative path.
The Contrapositive Equivalence
The fundamental law of deductive logic is: P → Q ⟺ ¬ Q → ¬ P P \rightarrow Q \iff \neg Q \rightarrow \neg P P → Q ⟺ ¬ Q → ¬ P A conditional statement and its contrapositive are logically identical in truth value. If a conditional rule is true, its contrapositive is unconditionally true. However, its converse ( Q → P Q \rightarrow P Q → P ) and its inverse ( ¬ P → ¬ Q \neg P \rightarrow \neg Q ¬ P → ¬ Q ) are formal fallacies.
- Proposition Name Symbolic Form Logical Status Relative to P → Q P \rightarrow Q P → Q
- Original Statement P → Q P \rightarrow Q P → Q Given True
- Contrapositive ¬ Q → ¬ P \neg Q \rightarrow \neg P ¬ Q → ¬ P Logically Equivalent (Always True)
- Converse Q → P Q \rightarrow P Q → P Invalid Fallacy (Unknown Truth Value)
- Inverse ¬ P → ¬ Q \neg P \rightarrow \neg Q ¬ P → ¬ Q Invalid Fallacy (Unknown Truth Value)
- Translating Bureaucratic and Statutory Language
On the CRE Aptitude Test, premises rarely arrive in tidy mathematical symbols like P → Q P \rightarrow Q P → Q . They are embedded in dense bureaucratic prose. You must instantly translate these linguistic formulations into proper directional conditionals.
1. Sufficient vs. Necessary Conditions
Sufficient Condition Indicator Words : if, when, whenever, every time, all who, any person who, provided that .
These words introduce the Antecedent (the left side: P P P ).
Sentence: "Any applicant who submits the form before the deadline is entered into the ballot."
Symbolic Form: On time → Entered \text{On time} \rightarrow \text{Entered} On time → Entered .
Necessary Condition Indicator Words : only if, only when, requires, must, is a prerequisite for, is a mandatory condition .
These words introduce the Consequent (the right side: Q Q Q ).
Sentence: "A candidate is eligible for the Administrative Officer interview only if they attain Level 2 in Use of English."
Symbolic Form: Eligible for AO Interview → Level 2 UE \text{Eligible for AO Interview} \rightarrow \text{Level 2 UE} Eligible for AO Interview → Level 2 UE .
Warning
Many candidates see the word "if" in "only if" and mistakenly place the phrase into the antecedent. Remember: "P only if Q" means P → Q P \rightarrow Q P → Q . Attaining Level 2 in English ( Q Q Q ) does not guarantee an interview ( P P P ); rather, without Level 2, an interview is strictly impossible ( ¬ Q → ¬ P \neg Q \rightarrow \neg P ¬ Q → ¬ P ).
2. The Logic of "Unless"
In administrative regulations, the word "unless" appears constantly:
"An application will be rejected unless it is countersigned by a directorate supervisor."
The Universal Translation Formula for "Unless": A unless B ⟺ ¬ B → A ⟺ ¬ A → B \text{A unless B} \iff \neg B \rightarrow A \iff \neg A \rightarrow B A unless B ⟺ ¬ B → A ⟺ ¬ A → B Replace "unless" with "if not" :
"If an application is not countersigned by a directorate supervisor, it will be rejected" ( ¬ Countersigned → Rejected \neg \text{Countersigned} \rightarrow \text{Rejected} ¬ Countersigned → Rejected ).
Contrapositive: "If an application is not rejected, it must have been countersigned" ( ¬ Rejected → Countersigned \neg \text{Rejected} \rightarrow \text{Countersigned} ¬ Rejected → Countersigned ).
3. Biconditionals: "If and Only If"
A biconditional ( P ⟺ Q P \iff Q P ⟺ Q ) signifies that P P P and Q Q Q are both sufficient and necessary for each other. It means P → Q P \rightarrow Q P → Q and Q → P Q \rightarrow P Q → P . If one is true, the other must be true; if one is false, the other must be false.
Indicator phrases: if and only if, exactly when, precisely in cases where .
Chained Conditionals and Syllogistic Deduction Walkthrough
To observe how multi-step deductive logic operates under exam conditions, examine the following worked case study.
Fictional Regulatory Stimulus: Staff Benefit Rules
All Grade A officers ( S S S ) are Band 1 officers ( D D D ).
No Band 1 officer ( D D D ) is eligible for standard overtime cash compensation ( O O O ).
An officer is granted the Housing Benefit ( H H H ) only if they are a Band 1 officer ( D D D ).
An officer is entitled to the Travel Concession ( T T T ) if and only if they receive the Housing Benefit ( H H H ) and have completed at least 8 years of continuous civil service ( Y Y Y ).
Officer Chan is entitled to the Travel Concession ( T T T is True).
- Step-by-Step Formalization
- S → D S \rightarrow D S → D
- D → ¬ O D \rightarrow \neg O D → ¬ O
- H → D H \rightarrow D H → D (from "only if": receiving allowance requires Band 1 status)
- T ⟺ ( H ∧ Y ) T \iff (H \wedge Y) T ⟺ ( H ∧ Y ) (biconditional: entitlement implies both H H H and Y Y Y )
- T = True T = \text{True} T = True
- Deriving Inescapable Deductions
Deduction A (from Premise 4 and 5): Because T T T is True and T ⟺ ( H ∧ Y ) T \iff (H \wedge Y) T ⟺ ( H ∧ Y ) , both H H H and Y Y Y must be strictly True. Therefore, Officer Chan receives the Housing Benefit ( H H H ) , and Officer Chan has completed at least 8 years of continuous service ( Y Y Y ) .
Deduction B (from Premise 3 and Deduction A): We know H → D H \rightarrow D H → D . Since H H H is True, by Modus Ponens, Officer Chan is a Band 1 officer ( D D D ) .
Deduction C (from Premise 2 and Deduction B): We know D → ¬ O D \rightarrow \neg O D → ¬ O . Since Chan is a Band 1 officer ( D D D is True), by Modus Ponens, Officer Chan is NOT eligible for standard overtime cash compensation ( ¬ O \neg O ¬ O ) .
- Testing Distractor Traps on Officer Chan
- Trap Statement 1: "Officer Chan is a Grade A officer ( S S S )."
Analysis: We know S → D S \rightarrow D S → D , and we know Chan is D D D . Inferring S S S from D D D commits the Fallacy of Affirming the Consequent . Chan could be a an officer in any other Band 1 grade. This statement is not logically guaranteed .
Trap Statement 2: "If Officer Chan had completed only 7 years of service, she could still receive the Travel Concession."
Analysis: The rule specifies T ⟺ ( H ∧ Y ) T \iff (H \wedge Y) T ⟺ ( H ∧ Y ) . If Y Y Y is false (7 years < 8 < 8 < 8 years), the conjunction ( H ∧ Y ) (H \wedge Y) ( H ∧ Y ) is false, which necessitates that T T T is false. This statement directly contradicts the biconditional rule. +--------------------------------------------------------------------------+
- | DEDUCTIVE DERIVATION AUDIT TRAIL |
- +--------------------------------------------------------------------------+
- | Premise / Step | Symbolic Translation | Derived Truth State |
- |----------------------+-----------------------------+---------------------|
- | Given Fact | T is True | T = 1 |
- | Premise 4 (Bicond.) | T <-> (H AND Y) | H = 1, Y = 1 |
- | Premise 3 (Cond.) | H -> D | D = 1 |
- | Premise 2 (Negative) | D -> NOT O | O = 0 (Not eligible)|
- | Premise 1 (Trap) | S -> D (Affirming Conseq.) | S = UNKNOWN |
- +--------------------------------------------------------------------------+
- Independent Preparation Advisory
This guide is published independently by ExamFinch for self-study and examination preparation. It is not affiliated with, authorized by, sponsored by, or endorsed by the Civil Service Bureau of the HKSAR Government. Candidates should confirm examination formats and regulatory standards against official CSB documentation.