Diagonalisation Lemma & Representability in Q | Logic Lecture 28

Added:

Dialetheism and Paraconsistent Logic

While classical mathematical logic uses the Diagonalization Lemma to prove the incompleteness of Robinson arithmetic (Q) and Peano arithmetic, dialetheism offers a radical alternative. Promoted by logicians like Graham Priest, dialetheism rejects the classical principle of explosion (that a contradiction implies everything) and instead embraces paraconsistent logic. Under this view, Gödelian self-referential sentences and paradoxes are interpreted not as evidence of incompleteness, but as 'dialetheias'—genuine, true contradictions. Instead of concluding that arithmetic is incomplete, dialetheists argue that arithmetic is inconsistent yet non-trivial. This perspective challenges the foundational classical assumption that mathematical systems must be strictly consistent, offering an alternative framework for interpreting the limits of formal systems revealed by diagonalization.

Fundamentals of First-Order Logic, including formal languages, syntax, semantics, and proof systems.
The axioms of Robinson Arithmetic (Q) and its role as a weak system of arithmetic.
The concept of Gödel numbering (arithmetization of syntax) to encode formulas and proofs as natural numbers.
The definition of recursive (computable) functions and what it means for a relation or function to be definable in arithmetic.
The formal proof of Gödel's First Incompleteness Theorem using the Diagonalisation Lemma.
Gödel's Second Incompleteness Theorem and its implications for the limits of mathematical consistency proofs.
Tarski's Undefinability of Truth, which applies diagonalization to show that a system's truth predicate cannot be defined within that system.
Löb's Theorem and the study of Provability Logic (modal systems like GL).
252 views5likes47:33@philipwelch3429Original Release: 2021-04-21

Gödel's Diagonalization Lemma states that for any theory T extending Q (a weak arithmetic system) and any formula ψ(y) with free variable y, there exists a sentence χ in the language of T such that T proves χ is equivalent to ψ(χ), where χ is the diagonalization of the formula that asserts 'there exists y such that y is the diagonalization of ψ and ψ holds of y'. This lemma is the key technical tool used to prove Gödel's incompleteness theorems, as it allows the construction of self-referential statements within formal systems.