Formal Logic: Syllogisms and Truth Tables (SACE Stage 2 Philosophy)
“Use categorical syllogisms and propositional truth tables to test arguments for formal validity”
Formal logic tests whether an argument is valid purely by its logical form, ignoring the content of the statements. Categorical logic, going back to Aristotle, analyses syllogisms made of statements about classes (all, some, no) and uses rules to tell valid forms from invalid ones. Propositional logic analyses arguments built from whole statements joined by connectives such as and, or, if-then and not, and tests validity using truth tables and recognised valid forms like modus ponens. You need to be able to represent arguments formally and determine whether the conclusion must follow from the premises.
Jump to a section
What this dot point is asking
You need to represent arguments in standard logical form and apply syllogistic rules or truth tables to decide validity.
Categorical syllogisms
A categorical syllogism, the heart of Aristotle's logic, is an argument with two premises and a conclusion, each a categorical statement about classes. The four standard forms are universal affirmative (all S are P), universal negative (no S are P), particular affirmative (some S are P) and particular negative (some S are not P). A valid example: all mammals are warm-blooded; all whales are mammals; therefore all whales are warm-blooded.
Validity here depends on the arrangement of the three terms. The middle term appears in both premises but not the conclusion, and it must be distributed, referring to every member of its class, at least once, or the syllogism commits the fallacy of the undistributed middle. The argument all cats are animals, all dogs are animals, therefore all cats are dogs is invalid for exactly this reason: the middle term animals is never distributed, so the premises fail to connect cats and dogs. Diagramming with overlapping circles, as in Venn diagrams, makes such invalidity visible.
Propositional logic and connectives
Propositional logic treats whole statements as units and studies how their truth depends on logical connectives. The main ones are negation (not), conjunction (and), disjunction (or), the conditional (if-then) and the biconditional (if and only if). Each has a fixed meaning given by how it determines the truth of the compound from the truth of its parts. A conditional if P then Q, for instance, is false only when P is true and Q is false.
Truth tables
A truth table lists every possible combination of truth values for the simple statements in an argument and computes the resulting value of each premise and the conclusion. An argument is valid if there is no row in which all the premises are true and the conclusion is false. This gives a mechanical, decisive test for validity in propositional logic. If you can find even one such row, called a counterexample row, the argument is invalid.
For example, consider if it rains the match is cancelled; the match is cancelled; therefore it rained. The truth table reveals a row where the match is cancelled for another reason (the second premise true) but it did not rain (conclusion false) while the conditional stays true. The argument is invalid; this is the fallacy of affirming the consequent.
Recognised valid and invalid forms
Several forms recur often enough to learn by name. Modus ponens (if P then Q; P; therefore Q) is valid. Modus tollens (if P then Q; not Q; therefore not P) is valid. The two classic invalid look-alikes are affirming the consequent (if P then Q; Q; therefore P) and denying the antecedent (if P then Q; not P; therefore not Q). Recognising these forms lets you judge many everyday arguments at a glance, while the truth table provides the underlying justification for why the valid ones cannot lead from truth to falsehood.
The value of formal logic for philosophy is precision. By stripping away content and exposing structure, it lets you see whether a conclusion really follows, prevents persuasive but invalid reasoning from passing unchallenged, and provides a shared, checkable standard for evaluating arguments across every topic in the course.
The truth-table test for validity is a single rule: an argument is valid exactly when no row has all premises true and the conclusion false. Finding one such row proves invalidity; finding none proves validity. This is the mechanical heart of propositional logic.
A propositional validity question is mechanical once symbolised. Work it in steps.
Step 1: symbolise the argument
Translate into connectives, for example modus tollens as , , therefore .
Step 2: list every truth-value combination
For two simple statements there are four rows (); for three there are eight. Set out a column for each statement.
Step 3: compute premises and conclusion per row
Evaluate the conditional, the other premise and the conclusion in each row, remembering is false only when is true and false.
Step 4: apply the validity rule
The argument is valid exactly when no row has all premises true and the conclusion false. Finding one such counterexample row proves invalidity. The no-counterexample-row test is what the marks reward.
- Affirming the consequent
- From if P then Q and Q you cannot infer P; this invalid form is easily mistaken for the valid modus ponens.
- Forgetting to distribute the middle term
- A syllogism whose middle term is never distributed is invalid no matter how plausible the premises sound.
- Reading or as exclusive by default
- In standard logic, or is inclusive (one or the other or both) unless stated otherwise, which affects the truth table.
Assessment-style questions
Questions on this dot point, each with a worked answer, written by ExamExplained. Philosophy has no written exam, so use them to check your understanding before your assessment tasks.
Practice8 marksUse a truth table to determine whether the supplied propositional argument is valid, and name the form if it is a recognised one.Show worked answer →
An 8 mark task needs a correct table, the validity verdict and the form named.
Symbolise. Translate the argument into propositional form using connectives, for example , , therefore .
Build the table. List every combination of truth values and compute each premise and the conclusion.
Apply the rule. The argument is valid exactly when no row has all premises true and the conclusion false; if such a row exists it is invalid.
Name the form. Identify modus ponens, modus tollens, affirming the consequent or denying the antecedent. Markers reward a correct table, the no-counterexample-row rule and the right form.
Practice6 marksExplain why the argument "all cats are animals; all dogs are animals; therefore all cats are dogs" is invalid.Show worked answer →
A 6 mark explain task needs the syllogistic diagnosis.
Identify the terms. Name the major, minor and middle terms; the middle term is animals.
State the rule. The middle term must be distributed at least once to connect the other two terms.
Diagnose. Here animals is never distributed, so the premises fail to link cats and dogs; this is the fallacy of the undistributed middle.
Illustrate. A Venn diagram shows cats and dogs need not overlap. Markers reward the undistributed-middle diagnosis, not just the claim that it is invalid.
Practise this
Sources & how we know this
- Stage 2 Philosophy subject outline (2025 onwards) — SACE Board
- Stage 2 Philosophy: external assessment — SACE Board