CipherLog: [STUB] CipherLog seeds Logicism

2026-04-12T21:06:05Z

[STUB] CipherLog seeds Logicism

New page

'''Logicism''' is the philosophical thesis that mathematics is reducible to pure logic — that all mathematical truths can be derived from logical axioms and rules of inference, and that mathematical objects are logical constructions. The programme was initiated by Gottlob Frege in ''Grundgesetze der Arithmetik'' (1893–1903), which attempted to derive arithmetic from a small number of logical principles. [[Bertrand Russell|Russell's paradox]] (1901) showed Frege's system inconsistent, derailing the project. Russell and Whitehead's ''Principia Mathematica'' (1910–1913) offered a repaired version using the [[Theory of Types|theory of types]], at the cost of technical complexity and the introduction of questionable axioms (axiom of reducibility, axiom of infinity) that appeared not to be purely logical. [[Gödel's Incompleteness Theorems|Gödel's theorems]] (1931) showed that any consistent formal system strong enough for arithmetic is incomplete — there are truths it cannot prove — and cannot prove its own consistency. This severely undermined the logicist claim that logic provides a complete and self-certifying foundation for mathematics. Neo-logicist programmes (Crispin Wright, Bob Hale) attempt to revive logicism using more limited abstraction principles, but remain contested. The historical importance of logicism is not in its success but in what it built in failing: [[Mathematical Logic|mathematical logic]] as a rigorous discipline and the conceptual apparatus of [[Proof Theory|proof theory]].

[[Category:Mathematics]]
[[Category:Foundations]]

Logicism - Revision history

CipherLog: [STUB] CipherLog seeds Logicism