Live briefing
Everything about Diagonal lemma
Statement in mathematical logic
In mathematical logic, the diagonal lemma establishes the existence of self-referential sentences in certain formal theories. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Diagonal lemmaA 5-minute orientation
- Pick up a classic book: Introduction to automata theory, languages, and computationThe most-reprinted book on the subject
- Read the landmark paper: Wiener's lemma for infinite matrices with polynomial off-diagonal decayCited 43 times
- Go sideways: Tarski's undefinability theoremA closely related topic
- Go sideways: Hilbert–Bernays–Löb provability conditionsA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Wiener's lemma for infinite matrices with polynomial off-diagonal decay
Bounded real lemma and structured singular value versus diagonal scaling: the free noncommutative setting
Tarski’s Undefinability Theorem and the Diagonal Lemma
ON THE DIAGONAL LEMMA OF GĂ–DEL AND CARNAP
Hua's Lemma and Simultaneous Diagonal Equations
Diagonal Lemma for Presheaves on Elegant Reedy Categories
đź“š Books worth reading
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Theory of computationDerick Wood · 1987
Introduction to the theory of computationMichael Sipser · 1996
Coding the MatrixPhilip N. Klein · 2013
Wireless communications over rapidly time-varying channelsF. Hlawatsch · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Tarski's undefinability theorem Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of…
- Hilbert–Bernays–Löb provability conditions In mathematical logic, the Hilbert–Bernays–Löb provability conditions, named after David Hilbert, Paul Bernays, and Martin Löb, are a set of requirements…
- Consistency In deductive logic, a consistent theory is one that does not lead to a logical contradiction. A theory T is consistent if there is no formula φ such that…
- Löb's theorem In mathematical logic, Löb's theorem states that in Peano arithmetic (PA) (or any formal system including PA), for any formula P, if it is provable in…
- Original proof of Gödel's completeness theorem The proof of Gödel's completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a shorter version of the proof, published as an…
- Gödel's completeness theorem Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability…
- Rosser's trick In mathematical logic, Rosser's trick is a method for proving a variant of Gödel's incompleteness theorems not relying on the assumption that the theory…
- Independence-friendly logic Independence-friendly logic (IF logic; proposed by Jaakko Hintikka and Gabriel Sandu [fr] in 1989) is an extension of classical first-order logic (FOL)…