Principia Mathematica is modern and insightful
A deep dive into Principia Mathematica argues that the early 20th-century mathematical opus is remarkably modern, particularly for programming language theorists. The author unearths anticipations of concepts like referential transparency, lambda calculus, and type theory within its pages. This piece delights HN readers by showcasing how foundational logic from over a century ago foreshadowed core ideas in contemporary computer science.
The Lowdown
This article posits that Alfred North Whitehead and Bertrand Russell's monumental Principia Mathematica, published over a century ago, reads like a modern text on programming languages. The author highlights several core concepts from Principia that have surprising resonance with contemporary computer science and logic.
- Referential Transparency and Extensionality: Principia is shown to contain early discussions of intension, extension, and referential transparency, distinguishing between contexts where substitution preserves meaning and those where it does not (e.g., "A believes p").
- Definitions as Typographic Convenience: The text emphasizes Principia's view of definitions as theoretically superfluous yet practically crucial for conveying intent and intellectual advancements.
- Propositional Functions and Lambda Calculus: The author details how Principia's "propositional functions" ('phi-hat-x') anticipate modern lambda calculus concepts, including free and bound variables, substitution, and alpha-equivalence, even illustrating with an analogy to definite integrals.
- "For Any" vs. "For All" (Intuitionism): Principia's distinction between schematic variables ("for any") and universally quantified variables ("for all") is explored, revealing an early glimpse into intuitionistic thought regarding generalization.
- Intuitionistic View on Existence: Russell and Whitehead are noted for implicitly adopting a constructivist approach to existence proofs, requiring a concrete witness, predating the formalization of intuitionism.
- Types: The article points out Principia's early usage of the term "type" in a context directly analogous to modern programming language type systems.
- Origin of Set-Membership: A brief etymological note traces the set-membership symbol '∈' back to the Greek word for "to be."
- Descriptive Functions: Principia's definition of functions as a particular form of binary relation is highlighted, connecting to Russell's earlier theory of definite descriptions.
Ultimately, the author finds Principia Mathematica to be a profoundly engaging and forward-thinking work, demonstrating that many fundamental ideas in modern computing and logic have deep historical roots in early 20th-century mathematical philosophy.