ACT Reasoning Ability – “Statement & Conclusion”
Goal
Given a short passage (the statement), determine which of the offered sentences is a conclusion that necessarily follows from that statement.
The conclusion must be logically entailed by the statement, but not any other sentence that could also be true in the same context.
Why it matters
This skill is the foundation of deductive reasoning on the ACT. Mastery here translates to better scores on all other reading and logic questions.
1. From First Principles: The Logic behind the Skill
| Term | Definition | Example |
|---|---|---|
| Premise | An asserted proposition that provides evidence or a basis for an inference. | “All cats are mammals.” |
| Conclusion | A proposition that follows logically from one or more premises. | “Whiskers is a mammal.” |
| Entailment | A logical relationship where the truth of all premises guarantees the truth of the conclusion. | If P and Q are true, then R must be true. |
| Validity | A property of a deductive argument: if the premises are true, the conclusion must be true. | The argument “All dogs are animals. Fido is a dog. Therefore Fido is an animal.” is valid. |
| Soundness | A valid argument whose premises are actually true. | The above argument is sound because the premises are true. |
Key principle: A conclusion must be necessary but not sufficient. That is, it must follow from the statement, but there may be other conclusions that also follow. The ACT only accepts the unique necessary conclusion.
2. Formal Representation
To analyze a passage rigorously, translate it into propositional logic.
2.1 Propositional Variables
| Symbol | Meaning |
|---|---|
| (P) | “All elephants are large.” |
| (Q) | “If something is large, it is not a mouse.” |
| (R) | “A particular animal is a mouse.” |
2.2 Logical Operators
| Operator | Symbol | Meaning |
|---|---|---|
| Conjunction | ( \land ) | “and” |
| Disjunction | ( \lor ) | “or” |
| Negation | ( \lnot ) | “not” |
| Conditional | ( \rightarrow ) | “if … then” |
| Contrapositive | ( \lnot Q \rightarrow \lnot P ) | Equivalent to ( P \rightarrow Q ) |
2.3 Truth Table Method
Construct a truth table for the premises and test each candidate conclusion. The conclusion is correct if it is true in every row where the premises are true.
Example
Premises:
- (P: \exists x (Elephant(x) \land Large(x)))
- (Q: \forall y (Large(y) \rightarrow \lnot Mouse(y)))
Candidate conclusion: (R: \lnot Mouse(Animal)).
Build a truth table with the two premises and evaluate (R).
Because the ACT does not provide the chance to use formal tools, the table is a mental exercise: identify necessary consequences, not all possible consequences.
3. Step‑by‑Step Methodology
| Step | Action | Rationale |
|---|---|---|
| 1 | Read the passage carefully. | Avoid misinterpretation. |
| 2 | Identify the statement (premise). | It is the only sentence that contains the facts. |
| 3 | List all candidate conclusions. | The answer choices. |
| 4 | Translate the statement into logical form. | Helps spot hidden implications (e.g., “If … then …”). |
| 5 | Determine what follows logically. | Use inference rules: Modus Ponens, Modus Tollens, Hypothetical Syllogism, etc. |
| 6 | Eliminate options that are not guaranteed. | Check if the conclusion could be false while the statement is true. |
| 7 | Confirm that no other option is also guaranteed. | The correct answer must be unique. |
| 8 | Choose the correct option. | The one that is both necessary and unique. |
Common inference rules
- Modus Ponens: If (P \rightarrow Q) and (P), then (Q).
- Modus Tollens: If (P \rightarrow Q) and (\lnot Q), then (\lnot P).
- Hypothetical Syllogism: If (P \rightarrow Q) and (Q \rightarrow R), then (P \rightarrow R).