How can the validity of an argument be tested by its logical form alone?
Use categorical syllogisms and propositional truth tables to test arguments for formal validity
Formal logic tests validity by form alone. Categorical syllogisms analyse arguments about classes, while propositional logic uses truth tables and valid forms such as modus ponens to determine whether a conclusion must follow.
Reviewed by: AI editorial process; not yet individually human-reviewed
Have a quick question? Jump to the Q&A page
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.