DeepAI AI Chat
Log In Sign Up

Computational expressivity of (circular) proofs with fixed points

by   Gianluca Curzi, et al.

We study the computational expressivity of proof systems with fixed point operators, within the `proofs-as-programs' paradigm. We start with a calculus μ𝖫𝖩 (due to Clairambault) that extends intuitionistic logic by least and greatest positive fixed points. Based in the sequent calculus, μ𝖫𝖩 admits a standard extension to a `circular' calculus 𝖒μ𝖫𝖩. Our main result is that, perhaps surprisingly, both μ𝖫𝖩 and 𝖒μ𝖫𝖩 represent the same first-order functions: those provably total in Ξ ^1_2-𝖒𝖠_0, a subsystem of second-order arithmetic beyond the `big five' of reverse mathematics and one of the strongest theories for which we have an ordinal analysis (due to Rathjen). This solves various questions in the literature on the computational strength of (circular) proof systems with fixed points. For the lower bound we give a realisability interpretation from an extension of Peano Arithmetic by fixed points that has been shown to be arithmetically equivalent to Ξ ^1_2-𝖒𝖠_0 (due to MΓΆllerfeld). For the upper bound we construct a novel computability model in order to give a totality argument for circular proofs with fixed points. In fact we formalise this argument itself within Ξ ^1_2-𝖒𝖠_0 in order to obtain the tight bounds we are after. Along the way we develop some novel reverse mathematics for the Knaster-Tarski fixed point theorem.


page 1

page 2

page 3

page 4

βˆ™ 10/01/2021

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

This article re-examines Lawvere's abstract, category-theoretic proof of...
βˆ™ 03/05/2018

Fixed-point elimination in the Intuitionistic Propositional Calculus (extended version)

It is a consequence of existing literature that least and greatest fixed...
βˆ™ 01/14/2020

A circular proof system for the hybrid mu-calculus

We present a circular and cut-free proof system for the hybrid mu-calcul...
βˆ™ 08/06/2019

Circular Proofs as Session-Typed Processes: A Local Validity Condition

Proof theory provides a foundation for studying and reasoning about prog...
βˆ™ 01/15/2020

Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points

Inductive and coinductive structures are everywhere in mathematics and c...
βˆ™ 07/26/2018

On the logical complexity of cyclic arithmetic

We study the logical complexity of proofs in cyclic arithmetic (CA), as ...
βˆ™ 07/02/2019

Formalizing the Solution to the Cap Set Problem

In 2016, Ellenberg and Gijswijt established a new upper bound on the siz...