Study guide

6.2 Deductive Syllogisms: True, False, or Uncertain Determinations

Wonderlic Scholastic Level Exam SLE

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Scoring & Test Mechanics

1.1 Wonderlic SLE vs. SLE-Q: Format, Administration, Scoring, and Program Cut Scores 1.2 Pacing Under the 12-Minute Clock: Time Budgets, Checkpoints, and Wonderlic's Answering Instructions 1.3 Rapid Elimination, Distractor Patterns, and Working Efficiently

2 Chapter 2: Verbal Reasoning — Word Comparisons, Analogies & Sentence Forming

2.1 Synonym and Antonym Identification Under Time Constraints 2.2 Word Analogies and Relational Logic 2.3 Sentence Forming (Disarranged Sentences) and Word Meaning in Context

3 Chapter 3: Verbal Reasoning — Logic, Proverbs & Classification

3.1 Interpreting Proverbs and Figurative Meaning 3.2 Word Classification and Categorization (Odd-Word-Out)

4 Chapter 4: Quantitative Reasoning — Mental Arithmetic & Proportions

4.1 High-Speed Mental Arithmetic and Order of Operations (No-Calculator Fluency) 4.2 Fractions, Decimals, and Value Comparison Shortcuts 4.3 Percentages, Ratios, and Rapid Proportions

5 Chapter 5: Applied Math — Word Problems, Averages, Dates, Measures & Graphs

5.1 Rate, Time, Distance, and Work Word Problems 5.2 Averages, Estimation Shortcuts, and Quick Approximations 5.3 Dates, Times, and U.S./Metric Measurement Problems 5.4 Graphs: Matching Data to a Graph and Reading Values Quickly

6 Chapter 6: Logical & Abstract Reasoning

6.1 Number Series, Sequence Rules, and Alternating Patterns 6.2 Deductive Syllogisms: True, False, or Uncertain Determinations 6.3 Letter Series, Pattern Sequences, and Ordering Logic

7 Chapter 7: Folding Boxes, Rotational Series & Comparison Speed

7.1 Folding Boxes: 3D Cube Folding and Surface Net Visualization 7.2 Rotational Series, Shape Rotations, Symmetry, and Colored-Square Patterns 7.3 Perceptual Speed, Error Detection, and Data Comparison Drills

6.2 Deductive Syllogisms: True, False, or Uncertain Determinations

Key Takeaways Explain This Topic AI

Wonderlic deductive syllogisms present two premises and a conclusion, requiring candidates to categorize the conclusion strictly as True, False, or Uncertain.

A conclusion can only be marked 'True' if it is guaranteed with absolute logical necessity by the stated premises; empirical real-world plausibility or outside common knowledge must never be substituted for deductive proof.

Universal Affirmative statements ('All A are B') establish a subset relationship where set A is contained within set B, but do not imply the converse that all B are A (affirming the consequent is a major logical fallacy).

Particular Affirmative statements ('Some A are B') guarantee that at least one member exists in the intersection, but do not imply that 'most' or 'all' members belong to the category, nor that any members lie outside.

The 'Uncertain' answer is the most common trap: whenever a conclusion could be true under one arrangement of the premises but false under another, the answer is Uncertain.

Last updated: September 2026

6.2 Deductive Syllogisms: True, False, or Uncertain Determinations

The 3-statement logic puzzle is one of the most recognizable and intellectually demanding question formats on the Wonderlic Scholastic Level Exam (SLE) . Typically framed as two premise statements followed by a third concluding statement, the item asks a deceptively simple question:

"Statement 1: ... Statement 2: ... Statement 3: ... If the first two statements are true, is the final statement True, False, or Uncertain?"

Syllogisms are one of the item types Wonderlic names for the SLE. Some versions label the choices true / false / uncertain ; others use yes / no / uncertain . The logic is the same.

While high-scoring candidates consistently resolve these items in under 12 seconds, unprepared test-takers routinely fall into psychological traps. The primary source of error is not intellectual complexity, but a failure to distinguish between real-world empirical plausibility and formal deductive validity . To master this section, you must suspend your everyday assumptions about reality and evaluate arguments strictly through the mechanics of formal categorical logic.

The Three Permissible Determinations

On the Wonderlic SLE, every 3-statement deductive problem resolves into one of exactly three logical statuses: +-------------------------------------------------------------------------+

  • | THE THREE DEDUCTIVE DETERMINATIONS |
  • +-------------------+-----------------------------------------------------+
  • | TRUE | The conclusion is INESCAPABLE and MANDATORY based |
  • | (Logically Valid) | strictly on the premises. There is zero scenario |
  • | | in which the premises hold but the conclusion fails.|
  • +-------------------+-----------------------------------------------------+
  • | FALSE | The conclusion DIRECTLY CONTRADICTS the premises. |
  • | (Contradicts the | It is impossible for the conclusion to be true |
  • | premises) | if the premises are accepted as facts. |
  • +-------------------+-----------------------------------------------------+
  • | UNCERTAIN | The conclusion COULD be true, but is NOT GUARANTEED.|
  • | (Indeterminate) | If you can construct even one valid scenario where |
  • | | the premises are true but the conclusion is false, |
  • | | the determination MUST be Uncertain. |
  • +-------------------+-----------------------------------------------------+
  • The "Uncertain" Trap: Plausibility vs. Necessity

The most common trap in these items is a Statement 3 that sounds reasonable in everyday life, even though the premises do not logically necessitate it.

Consider this illustrative example:

Statement 1: All pediatric nurses work at St. Jude Hospital.

Statement 2: David works at St. Jude Hospital.

Statement 3: David is a pediatric nurse.

In everyday conversation, one might think, "Well, David works there, so he might easily be a pediatric nurse." But in deductive logic, Statement 3 is Uncertain . Knowing that all pediatric nurses are at St. Jude does not mean everyone at St. Jude is a pediatric nurse. St. Jude employs surgeons, pharmacists, radiology technicians, administrators, and janitorial staff. David could easily be an MRI technologist or an accountant. Because David's status as a pediatric nurse is possible but not guaranteed, marking "True" is a fatal logical error. The correct answer is strictly Uncertain .

Formal Logic Rules: The Four Categorical Propositions

Categorical logic governs relationships between classes or groups of entities. Understanding the four standard categorical forms and their subset representations is essential for instantaneous analysis.

1. Universal Affirmative: "All A are B"

Meaning: Every single member of set A is completely contained within set B ( A ⊆ B A \subseteq B A ⊆ B ).

Valid Deductions:

If an entity is in A, it is guaranteed to be in B ( x ∈ A ⟹ x ∈ B x \in A \implies x \in B x ∈ A ⟹ x ∈ B ).

If an entity is NOT in B, it cannot be in A ( x ∉ B ⟹ x ∉ A x \notin B \implies x \notin A x ∈ / B ⟹ x ∈ / A , known as Modus Tollens or the contrapositive).

Invalid Fallacy (Illicit Conversion): Assuming "All B are A." Set B can be vastly larger than set A. Knowing that all spaniels are dogs does not mean all dogs are spaniels!

2. Universal Negative: "No A are B"

Meaning: Sets A and B are completely mutually disjoint. Their intersection is empty ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ).

Valid Deductions:

If an entity is in A, it is guaranteed NOT to be in B.

If an entity is in B, it is guaranteed NOT to be in A.

  • Bidirectional symmetry: "No A are B" is logically identical to "No B are A."
  • 3. Particular Affirmative: "Some A are B"

Meaning: There is at least one entity that belongs to both set A and set B ( A ∩ B ≠ ∅ A \cap B \neq \emptyset A ∩ B  = ∅ ).

Crucial SLE Distinction: In casual English, "some" often implies "some, but not all." In formal logic, "some" means strictly "at least one (and potentially all)."

What is NOT Proven: "Some A are B" does not prove that "Some A are not B." If a premise states that Some surgical tools are sharp , it remains logically possible that all surgical tools are sharp.

Invalid Deductions: You cannot conclude that most, many, or all members share the attribute.

4. Particular Negative: "Some A are not B"

Meaning: At least one member of set A falls outside set B ( A ∖ B ≠ ∅ A \setminus B \neq \emptyset A ∖ B  = ∅ ).

What is NOT Proven: It does not prove that "No A are B" or that any members of A are in B.

Categorical Relationship Summary Matrix

Proposition Form Technical Name Set Theory Notation What is Guaranteed (True) Common Fallacy (Uncertain Trap)

All A are B Universal Affirmative A ⊆ B A \subseteq B A ⊆ B Any member of A is in B; anything not in B is not in A. Assuming any member of B must be in A (affirming the consequent).

No A are B Universal Negative A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ Zero overlap; anything in A is not in B; anything in B is not in A. Assuming A and B can overlap under special exceptions.

Some A are B Particular Affirmative A ∩ B ≠ ∅ A \cap B \neq \emptyset A ∩ B  = ∅ At least one entity belongs to both sets. Assuming that because some are, some must NOT be (or assuming all are).

Some A are not B Particular Negative A ∖ B ≠ ∅ A \setminus B \neq \emptyset A ∖ B  = ∅ At least one entity in A is excluded from B. Assuming that no A can be in B.

Venn Diagram and Circle Overlap Mental Models

Under the 14.4-second clock, you do not have time to draw elaborate geometric figures on paper. However, maintaining a clear mental Venn diagram model allows you to test deductive validity in two seconds. MENTAL VENN DIAGRAM ARCHITECTURES

  • [ All A are B ] [ No A are B ] [ Some A are B ]
  • (Concentric Circles) (Separated Disjoint) (Overlapping Circles)
  • +-------------+ +-----+ +-----+ +----+---+----+
  • | B (Outer) | | A | | B | | |* *| |
  • | +-----+ | | | | | | A |* *| B |
  • | | A | | +-----+ +-----+ | |* *| |
  • | +-----+ | +----+---+----+
  • +-------------+ Intersection
  • The Counterexample Test (The Fast Filter for "Uncertain")

To determine whether a conclusion is True, False, or Uncertain in 5 seconds, use the Counterexample Test :

Accept the first two statements as unquestioned boundaries.

Attempt to mentally draw a configuration where the first two statements remain 100% true, but the third statement fails .

If you can imagine even one valid configuration where the conclusion is false , the statement CANNOT be True. It is immediately classified as Uncertain (or False if it directly contradicts the premises in every configuration).

Case Study 1: The Transitive Chain (True)

Premise 1: All radiologic technologists are certified medical imaging specialists.

Premise 2: All certified medical imaging specialists must complete radiation safety protocols.

Conclusion: All radiologic technologists must complete radiation safety protocols.

Analysis: This represents a classic transitive chain: A ⊆ B A \subseteq B A ⊆ B and B ⊆ C B \subseteq C B ⊆ C . Therefore, set A is completely enclosed inside set C ( A ⊆ C A \subseteq C A ⊆ C ). The conclusion is inescapable. Determination: True .

Case Study 2: The Direct Contradiction (False)

Premise 1: No pharmaceuticals stored in Cabinet C require refrigeration.

Premise 2: Drug X is stored in Cabinet C.

Conclusion: Drug X requires refrigeration.

Analysis: Premise 1 establishes zero overlap between Cabinet C items and refrigerated items. Premise 2 places Drug X inside Cabinet C. The conclusion asserts that Drug X requires refrigeration, which directly violates Premise 1. It is impossible for the conclusion to be true under the given premises. Determination: False .

Case Study 3: The Undistributed Middle (Uncertain)

Premise 1: All physical therapists have completed clinical anatomy.

Premise 2: All occupational therapists have completed clinical anatomy.

Conclusion: All physical therapists are occupational therapists.

Analysis: Both physical therapists (A) and occupational therapists (C) reside inside the larger circle of clinicians who completed clinical anatomy (B). However, sets A and C can be completely separate from each other while still both being inside B. The premises establish no connection between A and C. Determination: Uncertain .

Step-by-Step Triage for SLE Logic Items

When confronting a 3-statement logic question:

Read Statement 1 and Statement 2 first. Identify the categories and establish the relationship ( A ⊆ B A \subseteq B A ⊆ B , A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , or A ∩ B ≠ ∅ A \cap B \neq \emptyset A ∩ B  = ∅ ).

Identify the middle term. If both premises link a subject to a common middle term, check whether the middle term is universal. If the middle term is only an outer container for two separate subsets, the relationship between those subsets is automatically Uncertain .

Test the conclusion. Does it represent an unbroken transitive link (True), an explicit violation of a disjoint constraint (False), or an unverified subset assumption (Uncertain)?

Loading diagram... Deductive Syllogism Evaluation Protocol