Article A4 ended with a thought: throughout A1–A4, we have been testing arguments by asking whether a conclusion "follows" from premises — and relying on our intuition to tell us when it does. Now consider this argument:
The uncomfortable truth is that intuition — even careful, philosophically trained intuition — can be fooled. The argument above has the same surface structure as valid arguments we have seen throughout this package, but the logical relationship between its premises and conclusion is subtly different in a way that defeats necessity. Without a formal language that makes the structure explicit and checkable by rule, this kind of error is easy to miss.
This is exactly the problem that formal logic was developed to solve. The philosophers and mathematicians who built propositional logic — from Aristotle through to Frege and Russell — wanted a language so precise that the question of whether an argument is valid could be settled by mechanical inspection, without relying on anyone's intuition at all.
The answer is yes — within limits. Propositional logic is that language. It replaces the ambiguous connectives of English ("or," "if," "and," "not") with symbols that have exact, stipulated, unambiguous meanings. It represents propositions as variables (P, Q, R) so that the logical structure of an argument can be displayed naked, independent of content. And it provides a mechanical procedure — the truth table — for testing whether any formula is valid, regardless of what the propositions are actually about.
By the end of this article, you will be able to represent philosophical arguments in propositional notation, construct truth tables to test their validity, and identify the most important valid and invalid argument forms by name. These skills connect directly back to everything in A1–A4 — they are the same ideas, now made fully explicit.
Atomic propositions and variables
Propositional logic begins with the same unit we identified in Article A1: the proposition. In formal logic, individual propositions are represented by capital letters called propositional variables: P, Q, R, and so on. These stand as placeholders for any declarative sentence you care to assign to them.
For example, we might let P stand for "It is raining" and Q stand for "The ground is wet." Once those assignments are fixed, we can build more complex propositions — called compound propositions — by combining variables using connectives.
The five connectives
Propositional logic uses five connectives. Each has a symbol, a name, and precise truth conditions — meaning we can specify exactly when the compound proposition it forms is true and when it is false.
The connective that most students find counterintuitive is the conditional (→). In ordinary English, "if it is raining, then the ground is wet" implies a real-world causal connection. In propositional logic, the conditional merely says: it will not be the case that the first proposition is true while the second is false. Crucially, if P is false — if it is not raining — the conditional is true regardless of whether Q is true or false. A promise is not broken when the condition for it never arises. This matters enormously when evaluating arguments.
Truth tables: the validity-checking machine
A truth table is a systematic procedure for testing a formula by working through every possible combination of truth values for its variables. With two variables (P and Q), there are four possible combinations (T/T, T/F, F/T, F/F). With three variables, there are eight. The truth table is exhaustive: it covers every case, so if a formula is true in all rows, it is a tautology — necessarily true. If an argument form produces a false conclusion when all premises are true in no row at all, the argument is valid.
Here is the complete truth table for the conditional P → Q:
| P | Q | P → Q | Interpretation |
|---|---|---|---|
| T | T | T | It is raining, and the ground is wet. The conditional holds. |
| T | F | F | Critical row: It is raining, but the ground is dry. The conditional is false — this is the only case where it fails. |
| F | T | T | It is not raining, but the ground is wet (other cause). The conditional is not violated. |
| F | F | T | It is not raining, and the ground is dry. The conditional is not violated. |
Key valid argument forms
Certain logical forms are valid — that is, they can never produce a false conclusion from true premises — and these forms recur so often in philosophical argument that they have earned proper names. Each one below should feel familiar: you have been using these patterns throughout A1–A4 without the formal notation.
Verifying modus ponens with a truth table
The claim that modus ponens is valid can now be proved mechanically. An argument form is valid if and only if there is no row in its truth table where all premises are true and the conclusion is false. We test this for P → Q, P ∴ Q:
| P | Q | Premise 1: P → Q | Premise 2: P | Conclusion: Q |
|---|---|---|---|---|
| T | T | T | T | T |
| T | F | F | T | F |
| F | T | T | F | T |
| F | F | T | F | F |
The formal fallacies: two invalid forms that look valid
We can now expose formally — with the same mechanical procedure — the two most important formal fallacies involving the conditional. Both involve mixing up the roles of antecedent and consequent in ways that natural language conceals.
Placing these two invalid forms next to their valid counterparts makes the structure of the error immediately visible. Modus ponens affirms P and concludes Q — correct. Affirming the consequent affirms Q and concludes P — invalid. Modus tollens denies Q and concludes ¬P — correct. Denying the antecedent denies P and concludes ¬Q — invalid. The symmetry is exact: these are the four possible ways to reason from a conditional, and exactly two of them are valid.
From Aristotle to Frege: the long road to formal logic
Aristotle's Prior Analytics was the first systematic attempt to study logical form rather than logical content. His syllogistic — the theory of three-proposition arguments — dominated Western logic for two millennia. It captured a great deal of valid reasoning and did so with impressive rigour for its time.
But Aristotelian syllogistic had limits. It could not handle relational statements ("Every philosopher who has studied Kant admires him"), it could not represent the full range of conditional reasoning, and it had no way of testing complex arguments involving more than two or three propositions. It was a powerful but incomplete tool.
The decisive transformation came in 1879, in a slim, dense pamphlet that virtually no one read at the time.
The practical skill this article is building toward is formalisation: taking an argument expressed in English and rewriting it in propositional notation. This process forces precision — ambiguities in the original argument become visible when you must commit to a formal representation.
How to formalise an argument — four steps
Step 1: Identify the conclusion and premises in standard form (A1 — you know how to do this). Step 2: Identify the atomic propositions — the simple, non-compound claims — and assign each a variable (P, Q, R…). Step 3: Identify the logical structure — which premises are conditionals? Which involve conjunction or disjunction? Step 4: Write the formalised argument using symbols in place of natural language, and check that the symbolic version accurately captures the original.
Worked formalisation 1: The Socrates argument
The argument from Article A1 — now rendered formally for the first time.
Worked formalisation 2: Popper's falsificationism as modus tollens
In Article A2, we saw that Popper's falsificationism involves testing a scientific theory by its predictions. It can now be rendered formally — and the argument form made explicit.
The limit propositional logic cannot cross
Propositional logic is powerful, but it treats propositions as atomic — indivisible units that are simply true or false. It cannot look inside a proposition and reason about the subjects and predicates it contains. This means it cannot handle arguments whose validity depends on quantifier words such as "all," "some," "every," "no," and "none."
Consider: "All philosophers are curious. Some curious people ask questions. Therefore, some philosophers ask questions." This argument is intuitively valid, and can be proved valid in predicate logic — the more powerful formal system that Frege actually developed. But in propositional logic, we would have to assign a single variable to "All philosophers are curious" (call it P), another to "Some curious people ask questions" (Q), and another to "Some philosophers ask questions" (R). Then our "argument" is just P, Q ∴ R — and a truth table immediately shows this is invalid (P and Q can both be true while R is false).
The formal representation has failed to capture the actual logical structure of the argument. This is not a failure of the argument — it is the limit of propositional logic. The validity of the argument depends on internal structure (the relationships between subjects, predicates, and quantifiers) that propositional logic is designed to ignore. Predicate logic (also called first-order logic) is the formal system that handles this — and it is taught in university-level formal logic courses. For senior secondary philosophy, propositional logic takes you very far indeed.
Logic and the computer
The most consequential application of formal logic is one that Frege and Russell never anticipated: the digital computer. In 1936, the mathematician Alan Turing proved that any computation could be reduced to a sequence of simple logical operations — and that an abstract machine operating on a tape of symbols could, in principle, compute anything computable. In 1937, Claude Shannon showed that propositional logic could be implemented in electrical circuits using Boolean algebra — the same logical system, with True and False replaced by 1 and 0, represented as high and low electrical voltages.
Every processor, every transistor, every logic gate in every device you have ever used implements the connectives from Unpack. A NAND gate implements ¬(P ∧ Q). An OR gate implements P ∨ Q. An XOR gate implements exclusive disjunction. The billions of logical operations your phone performs every second are, at the deepest level, the same mechanical truth-table operations you worked through in this article — just running at speeds measured in gigahertz. Formal logic is not an abstract philosopher's game: it is the operational foundation of the information age.
Logic and law
Legal reasoning has a deep structural affinity with conditional logic. Statutory law is often written in the form of conditionals: "If [legal conditions X and Y are satisfied], then [legal consequence Z follows]." Applying law to a case is modus ponens: establish the conditions (P1 and P2), derive the consequence (C). Contesting the application of a law is typically either a validity objection (this law does not have this form) or a soundness objection (condition X or Y is not satisfied in this case) — which maps directly to the A3 framework.
Hypothetical syllogism appears constantly in legal chains of reasoning: if the contract was formed, then consideration was required; if consideration was required, then it must have been provided; therefore, if the contract was formed, consideration must have been provided. Legal precedent reasoning has precisely this structure.
Wittgenstein and the limits of what can be said
Ludwig Wittgenstein — who studied under Russell at Cambridge and whose early philosophy grew directly from the work of Frege and Russell — drew a radical conclusion from the project of formal logic. In his Tractatus Logico-Philosophicus (1921), Wittgenstein argued that formal logic revealed the boundaries of what could be meaningfully said at all. Any proposition that could be expressed in a logically well-formed way was a picture of a possible state of the world. Propositions that could not be so expressed — including ethical, aesthetic, and metaphysical claims — were literally nonsense: not false, but outside the category of truth-apt statements entirely.
His famous conclusion — "Whereof one cannot speak, thereof one must be silent" — is not a counsel of quietism. It is an attempt to use the precision of formal logic to draw a boundary around meaningful discourse. Whether this boundary is rightly drawn is one of the most contested questions of twentieth-century philosophy. The later Wittgenstein effectively repudiated it. But the attempt itself illustrates something important: formal logic, taken seriously, does not leave philosophy's other questions intact. It changes what you think those questions are.
Gödel's incompleteness: a permanent limit
In 1931, Kurt Gödel proved something that stunned the mathematical world: any formal system powerful enough to express basic arithmetic must contain true statements that cannot be proved within that system. This is the first incompleteness theorem. The second states that no consistent formal system can prove its own consistency. Together they establish a permanent and ineliminable limit to formal methods: no matter how powerful a formal system you build, there will always be truths it cannot reach by its own rules.
This does not make formal logic useless — far from it. It establishes with mathematical precision what formal systems can and cannot do. The incompleteness theorems are themselves proved using formal logic, in one of the most dazzling self-referential arguments in the history of ideas. Philosophy of mathematics is still grappling with their implications. For the student of philosophy, the takeaway is this: even the most powerful formal tools have limits, and understanding those limits is part of understanding the tools.
Connecting forward to Article A6
You have now seen two different ways to represent the structure of an argument: the standard form layout from A1 (P1, P2 … ∴ C) and the symbolic notation of propositional logic introduced here. Both are linear — they present an argument as a sequence of statements moving toward a conclusion.
Article A6 introduces a third representation: the argument map. Instead of lines of text or symbols, an argument map is a diagram — a visual representation in which conclusions are connected to the premises that support them, objections are linked to the claims they challenge, and the overall architecture of complex reasoning becomes visible at a glance. For multi-layered philosophical arguments — the kind you encounter in ethics, political philosophy, and epistemology — argument mapping often reveals structure that neither linear presentation nor propositional notation makes immediately apparent. It is a tool that complements everything in this package.