Substructural fixed-point theorems and the diagonal argument: theme and variations
From MaRDI portal
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categories and theories (18C99) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)
Abstract: This article re-examines Lawvere's abstract, category-theoretic proof of the fixed-point theorem whose contrapositive is a `universal' diagonal argument. The main result is that the necessary axioms for both the fixed-point theorem and the diagonal argument can be stripped back further, to a semantic analogue of a weak substructural logic lacking weakening or exchange.
Recommendations
- Diagonal arguments and fixed points
- Cantor diagrams: a unifying discussion of self-reference
- Fixed points and self-reference
- Fixed points and diagonal method
- scientific article; zbMATH DE number 2152235
- Categorical pairs and the indicative shift
- Designing a Calculational Proof of Cantor's Theorem
- What is wrong with Cantor's diagonal argument?
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- On fixed-point theorems in synthetic computability
Cited in
(3)
This page was built for publication: Substructural fixed-point theorems and the diagonal argument: theme and variations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050008)
