Substructural fixed-point theorems and the diagonal argument: theme and variations

10/01/2021
by   David Michael Roberts, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2023

A fixed point theorem for COFEs

A new fixed point principle for complete ordered families of equivalence...
research
02/28/2023

Computational expressivity of (circular) proofs with fixed points

We study the computational expressivity of proof systems with fixed poin...
research
09/17/2018

Fixed point theorems for precomplete numberings

In the context of his theory of numberings, Ershov showed that Kleene's ...
research
09/28/2020

Fixed Points Theorems for Non-Transitive Relations

In this paper, we develop an Isabelle/HOL library of order-theoretic fix...
research
03/19/2019

Semantic programming: method of Δ_0^p-enrichments and polynomial analogue of the Gandy fixed point theorem

Computer programs fast entered in our life and the questions associated ...
research
12/07/2021

Goedel's Incompleteness Theorem

I present the proof of Goedel's First Incompleteness theorem in an intui...
research
07/14/2022

On Pitts' Relational Properties of Domains

Andrew Pitts' framework of relational properties of domains is a powerfu...

Please sign up or login with your details

Forgot password? Click here to reset