A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
From MaRDI portal
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.
Recommendations
Cites work
- A note on inconsistencies caused by fixpoints in a cartesian closed category
- A note on Russell's paradox in locally Cartesian closed categories
- An existence theorem for recursion categories
- Categorical fixed point semantics
- Existence and feasibility in arithmetic
- General computability
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3762019 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- Notes on the mathematical aspects of Kripke's theory of truth
- On Gödel incompleteness and finite combinatorics
- On the structure of paradoxes
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Understanding the infinite
Cited in
(39)- On the structure of paradoxes
- Cantor diagrams: a unifying discussion of self-reference
- Fixed points in lambda calculus. an eccentric survey of problems and solutions
- A Yabloesque paradox in epistemic game theory
- Epistemic horizons and the foundations of quantum mechanics
- The scope of Gödel's first incompleteness theorem
- Burali-Forti as a purely logical paradox
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Zeno machines and hypercomputation
- A negation-free proof of Cantor's theorem
- Logic in category theory
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Fixed points for consequence relations
- Liar-type paradoxes and the incompleteness phenomena
- Eliminating Self-Reference from Grelling's and Zwicker's Paradoxes
- Why categories?
- At the limits of thought
- Naming and Diagonalization, from Cantor to Godel to Kleene
- Fixed point constructions
- Categorical pairs and the indicative shift
- Diagonal arguments and fixed points
- Fixed-point models for theories of properties and classes
- scientific article; zbMATH DE number 221552 (Why is no real title available?)
- scientific article; zbMATH DE number 2109239 (Why is no real title available?)
- scientific article; zbMATH DE number 823597 (Why is no real title available?)
- Aspects of categorical recursion theory
- DIAGONALIZATION EXHIBITED IN THE LIAR PARADOX, RUSSELL’S PARADOX AND GÖDEL’S INCOMPLETENESS THEOREM
- Elementary cellular automata and self-referential paradoxes
- Fixed points and unfounded chains
- Substructural fixed-point theorems and the diagonal argument: theme and variations
- Changing the logic without changing the subject: the case of computability
- Fixed point theorems in computability theory
- Natural constructive proofs of A via A B, proof paradoxes, and impredicativity
- Diagonalization as computation: Gödel sentence construction and a type-disciplined blueprint
- Commutativity and self-reference
- Self-reference and fixed points: A discussion and an extension of Lawvere's theorem
- The nature of reflexive paradoxes. II
- An impossibility theorem on beliefs in games
- The diagonal argument and the Liar
This page was built for publication: A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650304)
