On the logical complexity of cyclic arithmetic

07/26/2018
by   Anupam Das, et al.
0

We study the logical complexity of proofs in cyclic arithmetic (CA), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing CΣ_n for (the logical consequences of) cyclic proofs containing only Σ_n formulae, our main result is that IΣ_n+1 and CΣ_n prove the same Π_n+1 theorems, for all n≥ 0. Furthermore, due to the 'uniformity' of our method, we also show that CA and Peano Arithmetic (PA) proofs of the same theorem differ only exponentially in size. The inclusion IΣ_n+1⊆ CΣ_n is obtained by proof theoretic techniques, relying on normal forms and structural manipulations of PA proofs. It improves upon the natural result that IΣ_n is contained in CΣ_n. The converse inclusion, CΣ_n ⊆ IΣ_n+1, is obtained by calibrating the approach of Simpson '17 with recent results on the reverse mathematics of Büchi's theorem in Kołodziejczyk, Michalewski, Pradic & Skrzypczak '16, and specialising to the case of cyclic proofs. These results improve upon the bounds on proof complexity and logical complexity implicit in Simpson '17 and also an alternative approach due to Berardi & Tatsuta '17. The uniformity of our method also allows us to recover a metamathematical account of fragments of CA; in particular we show that, for n≥ 0, the consistency of CΣ_n is provable in IΣ_n+2 but not IΣ_n+1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2017

Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic

A cyclic proof system gives us another way of representing inductive def...
research
10/03/2021

Cyclic Implicit Complexity

Circular (or cyclic) proofs have received increasing attention in recent...
research
11/29/2022

Non-uniform complexity via non-wellfounded proofs

Cyclic and non-wellfounded proofs are now increasingly employed to estab...
research
10/22/2021

A strong version of Cobham's theorem

Let k,ℓ≥ 2 be two multiplicatively independent integers. Cobham's famous...
research
02/28/2023

Computational expressivity of (circular) proofs with fixed points

We study the computational expressivity of proof systems with fixed poin...
research
05/05/2022

Adequate and computational encodings in the logical framework Dedukti

Dedukti is a very expressive logical framework which unlike most framewo...
research
05/10/2020

Dynamic IFC Theorems for Free!

We show that noninterference and transparency, the key soundness theorem...

Please sign up or login with your details

Forgot password? Click here to reset