## On the logical complexity of cyclic arithmetic

We study the logical complexity of proofs in cyclic arithmetic, as introduced by Simpson, in terms of quantiﬁer alternations of formulae occurring. Writing for (the logical consequences of) cyclic proofs containing only formulae, we show for : over sequents. This is obtained by proof theoretic techniques, relying on normal forms and structural manipulations of Peano …