Russell and Whitehead's Principia Mathematica: Logic and Mathematics

Michael BrenndoerferUpdated July 15, 202513 min read

Bertrand Russell and Alfred North Whitehead's 1910-1913 monumental attempt to derive all mathematics from logic, establishing the foundations of mathematical logic.

PhilosophyAll chapters
Reading tools Notes & comments
Notes & comments
Part 8 of 12Logic, Language, and Interpretation
Chapter 95The project of grounding mathematics in logic › Why a Familiar Sum Takes Work
Reading the full chapter · 9 sections · 13 min9 sections · 13 min

All 9 sections · 13 min read

The project of grounding mathematics in logic › Why a Familiar Sum Takes WorkFull chapter · Sections in this chapter1 / 9 ↓

Why a Familiar Sum Takes Work

In the first volume of Principia Mathematica, Alfred North Whitehead and Bertrand Russell prove that the union of two unit classes is a couple if the unit classes are disjoint. Their comment after proposition *54·43 says this will give 1 + 1 = 2 once arithmetical addition has been defined. In Volume II, *110·643, the sum finally appears as a theorem about cardinal addition. Neither result counts out two things on a table. Both make explicit what must be in place to derive the sum.

The delay is informative. Before they can add two numbers, the authors have to distinguish the size of a collection from the objects making it up. They also have to decide how to use talk of collections without reviving a contradiction that threatened an earlier attempt at the same project. The elementary sum is a place to see those decisions come together.

The three volumes, published from 1910 to 1913, attempt to develop substantial parts of mathematics using a logical calculus. The calculus lays out primitive propositions, definitions, and derivations in an order that lets a reader trace their dependence on one another. The philosophical question is whether the principles used by the calculus deserve to count as logic. The book makes this question unusually concrete by identifying the assumptions on which particular results depend.

The Problem With Unrestricted Collections

In the Introduction to Volume I, chapter II, Whitehead and Russell present contradictions that involve treating a domain as a completed totality. A familiar version starts with the proposed class of all classes that are not members of themselves. Call this proposed class R. If R is a member of itself, then it has the defining property required of its members, so it is not a member of itself. If it is not a member of itself, it satisfies the condition and is a member. The two conclusions come from applying the condition to the same thing the condition was used to specify.

This problem mattered to the proposed foundations of arithmetic because the earlier Fregean project relied on a general provision for extensions or courses of values. In Frege's reply to Russell in 1902, he identifies Rule V of his Basic Laws of Arithmetic as being in trouble. One direction of that law takes agreement of functions at every argument to guarantee identity of their courses of values. The familiar class formulation gives the contradiction an accessible shape. It is a way to see the trouble, rather than an account of every step in Frege's original formal notation.

Whitehead and Russell give a broader diagnosis. In their account of the vicious-circle principle, the offending constructions involve an apparent totality whose own members would be specifiable only by using the same totality. Their concern is visible even in the idea of a proposition about literally all propositions. If the proposition produced by taking that totality is itself one of its members, we need to ask how the totality was fixed in order to formulate the proposition. The principle directs the construction of their hierarchy.

The conventional example about R helps distinguish two tactics. One could accept an unrestricted language and try to devise a theorem saying that some classes do not exist. In Principia, the prior question is whether the proposed expression has been formed within an admissible range of arguments. The rules governing expressions matter before there is a proposition about R to prove or disprove.

Types and Orders

A propositional function is an expression such as “x is a prime,” which gives a proposition when an appropriate argument is supplied. The role of the argument matters. Asking whether a number is prime differs from asking whether a mathematical property holds of all members of a given domain. The second question can take a function or a general statement as its subject matter. It calls for expressions with different ranges of argument.

The distinctions in chapter II, §§III–V constrain how these expressions can be formed. In the familiar type illustration, if the members of a class are drawn from one type, the class expression is at a different level from the things used as members. A proposed expression treating the class as its own member tries to make that one expression serve both roles. The class-of-all-classes example therefore loses the unrestricted membership expression it needed to get started.

Principia adds distinctions of order. These keep track of which ranges of function or proposition a definition is allowed to quantify over. For example, a claim about every function in a specified range can give rise to a new function. One needs to distinguish functions that can be given without that quantification from functions whose definition requires it. Without doing so, the phrase “every function” could be interpreted to include the very function still being defined. That is one reason the hierarchy is called ramified.

It helps to keep the two concerns apart while reading. The type of argument tells you what could be supplied to a function in the first place. Its order tracks the generality involved in specifying the function. A restriction at either level can change which proof steps are available. The system is harder to learn than a list of rules against a few famous paradoxes because the authors want those restrictions to govern ordinary mathematical reasoning too.

What Class Talk Is For

Chapter III of the Introduction gives a different side of the response. The authors treat descriptions and class expressions as incomplete symbols. Their contribution is explained through rules for whole sentences in which they occur. This gives the reader something to do with a statement that appears to name a special kind of object. Look at the whole statement and see how the expression can be eliminated.

The account of descriptions is a useful example. Imagine that a committee has appointed nobody as treasurer. The sentence “the committee's treasurer signed the letter” sounds as if it starts by naming an officeholder and then adds a claim about what that person did. On the analysis in the Introduction, an ordinary use of the sentence requires that exactly one person meets the description and that this person signed. If no one meets the description, there is no need to identify some special object referred to by the phrase. The conditions on the whole assertion already explain why it fails.

Class expressions receive a corresponding treatment. An expression for the class of things satisfying a condition can occur in mathematical sentences that can be analyzed using propositional functions. What matters in an extensional use is which arguments satisfy the function. Two functions that agree on all appropriate arguments can therefore support the same class talk. Eliminating a class expression in this way gives the calculus the mathematical uses of class language without simply adding a new object for every apparent class name. Whitehead and Russell distinguish accomplishing that technical purpose from proving that, as a matter of metaphysics, there could be no classes.

The tradeoff is visible when the role of an expression changes. A sentence may be about the condition a function expresses, or it may be concerned only with the things satisfying it. The analysis of class talk needs the second kind of use. A condition such as “has three sides” can matter to an explanation for reasons beyond the bare fact that the very same figures also satisfy “has three angles.” Class language lets the system use the agreement in application without requiring the two explanations to have the same content.

How Units Become a Sum

For a cardinal number, the relevant agreement is equinumerosity. Two collections are equinumerous when their members can be put into one-to-one correspondence. The collection of cups in a cupboard can have the same size as the collection of saucers even though none of the cups is a saucer. This is part of what lets cardinal arithmetic range over collections without making claims about the nature of their members. Russell gives a separate explanation of the idea in Introduction to Mathematical Philosophy, chapter II.

Two Singletons Need Distinct Members

The collection containing just Alice and the collection containing just Bob combine into a two-member collection. If two one-member collections both contain Alice, their union still has one member. The work of the disjointness condition is to make sure that the union represents a sum of sizes without any double counting.

Volume I, *51–54 develops unit classes and couples. A particular unit class has one member whose identity determines that unit class. Another unit class can have a different member while sharing its cardinal number. When *54·43 establishes the relation between disjoint unit classes and their union, it shows how those sizes are related before the operation of cardinal addition is available by definition.

Volume II, *110 defines arithmetical sums and develops their properties. At the level of an example, take disjoint representatives for the summands, form the combined collection, and use its cardinal number. A derivation must show that the answer depends on the cardinal numbers of the representatives, independently of which suitable representatives were used. Replacing Alice and Bob with two different people changes the membership of the combined collection. Its size is preserved by the correspondence pairing the old representatives with the new ones.

This makes the two propositions do different work. The one in Volume I belongs to a theory of unit classes and couples. The one in Volume II is expressed explicitly using cardinal addition. Citing the earlier page as the equation itself would hide a step in precisely the kind of reconstruction the book was designed to show.

Reading a Derivation Backward

Volume I, Introduction, chapter I distinguishes primitive ideas and primitive propositions. The authors need some expressions from which definitions can start and some propositions on which proofs can draw. A definition lets a new symbol stand for a longer expression built out of prior resources. An assumption adds something the system is entitled to use in a proof. Remaking a proof as a chain of definitions would conceal the point at which it needs an assumption.

The distinction is visible in the treatment of an elementary inference. Suppose a condition implies a result, and we are entitled to assert the condition. We can then infer the result. The implication alone does not supply an assertion of the result. In the Introduction, the authors include the principle governing this move among their primitive propositions for the calculus of propositions. They also distinguish the assertion sign from a sign occurring in the content of a proposition. Reading the notation requires paying attention to when a line asserts something and when a similar-looking expression occurs as a component of what it asserts.

The procedure for reading is worth trying even without mastering a whole page of symbols. Start with the numbered claim, identify what the strings around it designate, then consult one of the numbered earlier claims listed under the demonstration. You can be confident that a pair contains two members and still learn something from establishing exactly which earlier claims license that result.

The Price of the Hierarchy

The restrictions of the ramified theory can make mathematical statements difficult to recover in the form in which the authors want to use them. If a property was defined by quantifying over a wide range of functions, it may be of higher order than an inference requires. The issue arises even if the property has perfectly clear applications. The calculus needs a way to reach those same applications using a function admitted at the relevant order.

Chapter II, §VI introduces the axiom of reducibility. In the single-argument case, the axiom says that a given function is coextensive with a predicative function of the same argument. The latter occupies the appropriate lowest order. They agree as to which arguments satisfy them, however differently the original and the predicative function may be specified. The authors use this guarantee in their treatment of classes, among other places. It does specific work that the restrictions by themselves would leave undone.

Reducibility is a substantial commitment. Explaining why it is useful in a derivation does not decide whether it is a law of logic. The treatment of infinity makes a related problem plain. In Volume II, *120, the authors use infinity as an explicit hypothesis when it is needed. It ensures a supply of distinct elements for results that depend on it. They acknowledge that logic gives them no basis for settling its truth. This lets a proof make good on an important part of the plan even where it falls short of an unconditional reduction. The reader can see exactly where a special hypothesis is used.

This is one reason to resist judging the whole project by the success of a single derivation. The proof of a cardinal sum may need an analysis of disjoint union and cardinal identity. A theorem asserting the availability of arbitrarily many distinct terms brings a further issue. Asking what each proof assumes gives a more precise assessment than asking whether all of mathematics is really logic as an all-or-nothing question.

What the Formal Record Makes Visible

A familiar counting argument can be perfectly persuasive without recording every use of a definition. The authors want a derivation that can be examined after the informal insight has done its work. If two readers disagree, they can identify a primitive proposition, a definition, or an application of a rule and see whether that step has a warrant. The notation makes the details demanding to read. It also gives the readers a common object to examine.

Gödel later uses this precision for a different purpose. His 1931 paper takes Principia Mathematica and related systems as its point of reference. A system with effectively specified rules and enough arithmetic can have its formulas and proofs studied arithmetically. Under the hypotheses of the relevant incompleteness theorem, not every sentence the system can express is decidable by its proofs. This concerns the powers of a given formal system. Whether numbers and arithmetic can be explained through logical notions is a further question. A reader can accept limits on formal derivability and still investigate the reductions Principia makes.

One way to read the work is to follow the proof of the small sum backward. It leads from cardinal addition to unions of disjoint classes, from there to unit classes, and then to decisions about what class expressions mean. Each step explains something a simple use of arithmetic can leave implicit. This is a demanding way to establish a fact everyone already knows. The benefit is finding out how many different pieces of reasoning are involved in treating it as a theorem of a general system.

Reading the Two Volumes

Start with the Introduction to Volume I, chapter II for types and reducibility and chapter III for descriptions and classes. Then compare Volume I, *54·43, with Volume II, *110·643. These are proposition numbers, which are more reliable locators than pages across different printings.

Join the discussionAsk a question or share what you learned.

Comments

Add to the conversation

A question, a correction, or an example from your own work.

No comments yet. Be the first to share your thoughts!

A different angle
All writing
Philosophy

Derrida's Of Grammatology: Writing, Trace, and the Supplement

Jacques Derrida's 1967 inquiry into the relation between speech and writing, with close readings of Saussure, Lévi-Strauss, and Rousseau.

13 min read
Philosophy

Derrida's Writing and Difference: Structure, Sign, and Play

Jacques Derrida's 1967 collection of essays, with a close reading of “Structure, Sign, and Play” and companion essays on Foucault, Freud, and Levinas.

13 min read
Philosophy

Kripke's Naming and Necessity: Rigid Designation and Essentialism

Saul Kripke’s lectures on how names refer, why some necessary truths are discovered empirically, and what people and things could have been.

13 min read

About the author

Reference

Citation details

Cite or share this article.

BIBTEXAcademic
@misc{brenndoerfer2025russellwhitehead, author = {Michael Brenndoerfer}, title = {Russell and Whitehead's Principia Mathematica: Logic and Mathematics}, year = {2025}, url = {https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide}, organization = {mbrenndoerfer.com}, note = {Accessed: 2026-11-19} }
APAAcademic
Michael Brenndoerfer (2025). Russell and Whitehead's Principia Mathematica: Logic and Mathematics. Retrieved from https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide
MLAAcademic
Michael Brenndoerfer. "Russell and Whitehead's Principia Mathematica: Logic and Mathematics." 2026. Web. November 19, 2026. <https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide>.
CHICAGOAcademic
Michael Brenndoerfer. "Russell and Whitehead's Principia Mathematica: Logic and Mathematics." Accessed November 19, 2026. https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide.
HARVARDAcademic
Michael Brenndoerfer (2025) 'Russell and Whitehead's Principia Mathematica: Logic and Mathematics'. Available at: https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide (Accessed: November 19, 2026).
SimpleBasic
Michael Brenndoerfer (2025). Russell and Whitehead's Principia Mathematica: Logic and Mathematics. https://mbrenndoerfer.com/writing/russell-whitehead-principia-mathematica-logicism-guide
Newsletter

Stay up to date

Get new articles, book updates, and notes on AI and technology.

Unsubscribe at any time. Privacy policy