The definitive synthesis. Schröder's Algebra of Logic systematised Boolean algebra and the calculus of relations into the canonical axioms and duality we still use; his treatise was the standard reference for decades. Rigorous and foundational.
He finished others' work. The core ideas are Boole's, Peirce's, Jevons's; Schröder's genius was completeness and rigour, not a new spark. And the algebraic tradition he perfected was about to be eclipsed by [[gottlob-frege]]'s very different logic.
Also a set-theory name. The Schröder–Bernstein theorem — if each of two sets injects into the other, they have the same size — bears his name (his proof had a gap; Bernstein fixed it). A reminder he worked across foundations.
Here is the structure Schröder codified, in its cleanest example. Take the subsets of {a, b, c}, ordered by inclusion — eight nodes, drawn as a lattice (an edge goes up when you add one element). Two operations make it an algebra: the meet (∧, greatest common part = intersection) and the join (∨, least common container = union). Click any two nodes; the diagram finds their meet and their join. Every law Schröder axiomatised — commutativity, absorption, distributivity, complement — holds here, visibly.
"The calculus of logic … is to become an organon of deductive thought." — in the spirit of Schröder's Vorlesungen
A complete axiomatic treatment of Boolean algebra and the calculus of relations, with the principle of duality at its heart — the canonical form in which Boole's idea entered mathematics permanently.
Schröder perfected the algebraic tradition (logic as equations). At the same moment [[gottlob-frege]] was building the quantificational tradition (logic as a formal language). The future went Frege's way — but the algebra stayed essential.
Schröder sits at a fascinating hinge. He brought the algebra of logic — Boole's line — to its absolute peak just as that whole approach was about to be overshadowed by [[gottlob-frege]]'s and [[bertrand-russell]]'s logic of quantifiers and functions, which proved better for the foundations of mathematics. It would be easy to read Schröder as the magnificent end of a dead branch. But the branch wasn't dead: the algebraic, equational view of logic he perfected is exactly the one that came roaring back through [[claude-shannon]] and into computer science — Boolean algebra, lattice theory, and the calculus of relations are the daily mathematics of circuits, databases, and program logic. He didn't pick the losing side; he finished the side that the machines would need. ⚑ The man who handed the future a completed algebra. [[john-venn]] ← · next → the modern foundations.
Gate kept on. The honest measure of Schröder is consolidation of the highest order. His three-volume Vorlesungen über die Algebra der Logik (1890–1905) is a genuine landmark — it gathered the fragmentary results of [[george-boole]], [[augustus-de-morgan]], [[charles-peirce]], and [[william-stanley-jevons]] into a single rigorous edifice, fixed the canonical laws and the duality principle, and developed Peirce's calculus of relations more fully than Peirce had; for decades it was the reference on algebraic logic. The honest qualification is that Schröder was a systematiser, not an originator — the deep ideas were others', and his life's work perfected an approach that [[gottlob-frege]]'s quantificational logic was simultaneously rendering secondary for the foundations of mathematics (a fact Schröder, who debated Frege, did not fully accept). He also lent his name to the Schröder–Bernstein theorem in set theory (his own proof was flawed; Felix Bernstein completed it), and worked on iteration and functional equations. He died in 1902 with his treatise unfinished. To build the cathedral that holds another's vision is its own kind of greatness — and the algebra he completed is the one running in [[psephos-processors-domain]]. ⚑ [[john-venn]] ← · the lineage runs on to the modern foundations.