References & Further Reading

Ancient Sources of Self-Reference

Epimenides of Crete — Fragment quoted in the Epistle to Titus (New Testament), Titus 1:12 — An early formulation of the liar paradox, linking truth, self-reference, and contradiction.

Clement of Alexandria — Stromata (late 2nd century) — Preserves a longer version of the Epimenides fragment within early Christian philosophical commentary.

Diogenes Laërtius — Lives of Eminent Philosophers (3rd century) — A key source for early paradoxes and figures such as Eubulides.

Eubulides of Miletus — Megarian philosopher (4th century BC) — Traditionally credited with refining paradoxes of self-reference, including the liar.

Foundations of Set Theory and Paradox

Cantor, Georg — “On an Elementary Question in the Theory of Manifolds” (1891) — Presents the diagonal argument later echoed in Gödel’s theorem.

Russell, Bertrand — Letter to Gottlob Frege (1902) — Reveals Russell’s paradox and contradictions in naive set theory.

Russell, Bertrand & Alfred North Whitehead — Principia Mathematica (1910–1913) — A monumental attempt to ground all of mathematics in formal logic.

The Foundations Crisis

Hilbert, David — “On the Infinite” (1925) — Statement of Hilbert’s program to secure mathematics through formal systems.

Brouwer, L. E. J. — “Intuitionism and Formalism” (1912) — Challenges formalism and emphasizes constructive mathematics.

Gödel and Incompleteness

Gödel, Kurt — “On Formally Undecidable Propositions of Principia Mathematica and Related Systems I” (1931) — Shows that sufficiently strong formal systems contain true but unprovable statements.

Rosser, J. Barkley — “Extensions of Some Theorems of Gödel and Church” (1936) — Strengthens Gödel’s result by weakening required assumptions.

Nagel, Ernest & James Newman — Gödel’s Proof (1958) — A clear and accessible introduction to incompleteness.

Computation and Mechanism

Turing, Alan — “On Computable Numbers, with an Application to the Entscheidungsproblem” (1936) — Defines effective computation and introduces the Turing machine.

Another one

Church, Alonzo — “An Unsolvable Problem of Elementary Number Theory” (1936) — Presents λ-calculus as an equivalent model of computation.

Lucas, J. R. — “Minds, Machines and Gödel” (1961) — Argues that Gödel’s theorem limits mechanistic models of mind.

Penrose, Roger — The Emperor’s New Mind (1989) — Revives and sharpens the Gödelian critique of mechanism.

Penrose, Roger — Shadows of the Mind (1994) — Extends the argument and explores non-computational aspects of thought.