Diagonalisation Theorems and Logical Consequences in Arithmetic

Added:

Ultrafinitism and the Critique of Platonist Self-Reference

While Gödel's incompleteness theorems are mathematically rigorous within classical mathematics, alternative foundational programs like Ultrafinitism (or Strict Finitism) challenge the philosophical and mathematical assumptions underlying diagonalisation. Ultrafinitists, such as Alexander Esenin-Volpin, reject the notion of an infinite sequence of natural numbers and express skepticism toward the existence of arbitrarily large integers. Because Gödel numbering requires mapping complex logical formulae to astronomically large integers, ultrafinitists argue that these representations lose physical and constructive meaning. From this perspective, diagonalisation is viewed not as a discovery of inherent logical limitations, but as a pathological consequence of adopting idealized, non-constructive mathematical frameworks. By rejecting the actual infinity of the natural numbers, ultrafinitism seeks to ground mathematics in what is feasibly computable, thereby bypassing or rejecting the standard interpretations of incompleteness and undecidability.

First-Order Logic: Familiarity with formal languages, syntax, semantics, and the distinction between soundness and completeness.
Cantor's Diagonal Argument: Understanding of set cardinality and how Cantor proved the uncountability of the real numbers.
Peano Arithmetic (PA): Basic knowledge of the axiomatic system used to define the natural numbers and formal arithmetic.
Introduction to Computability Theory: Conceptual understanding of Turing machines, algorithms, and the Halting Problem.
Tarski's Undefinability Theorem: Investigating the limits of defining the concept of 'truth' within formal arithmetic systems.
Provability Logic (GL): Exploring modal logic systems that formalize the concept of mathematical provability and self-reference.
Algorithmic Information Theory: Studying Kolmogorov complexity and Chaitin's Omega constant as an information-theoretic view of incompleteness.
Model Theory and Non-Standard Arithmetic: Examining non-standard models of Peano Arithmetic that satisfy the same first-order axioms.
865 views13likes31:23@gregrestallOriginal Release: 2020-04-10

Diagonalisation is a powerful technique that converts facts about numbers into facts about formulas by applying a formula to its own Gödel number, enabling the proof that consistent theories extending Robinson's arithmetic (including Peano arithmetic) are both incomplete and undecidable, while also demonstrating that truth in arithmetic cannot be defined within the system itself.