A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
Noson S. Yanofsky
Abstract
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.
Create a lesson
Related papers
The rank problem for metric spaces
Asger Tornquist
Differential equations as difference-differential equations
Wei Li, Thomas Scanlon
Classification of bipartite observables III: simplicity, mixtures and quantum error correction
Eduardo Dueñez, José Iovino
Indiscernible Extraction in Theories with Bounded k-splitting
Connor Watson
Discrete Temporal CSPs et al
Lukas Pieper
Local definable (p,q)-theorem and a refinement
Gareth John Boxall, Charlotte Kestner, Tsinjo Rakotonarivo