Cyclic proofs in the equational version of Primitive recursive arithmetic

Abstract

In this brief note, we present a cyclic proof system developed specifically for the equational version of Primitive recursive arithmetic and establish the equivalence of the two systems. A distinctive feature of our approach is that it does not rely on automata-theoretic methods but is implemented primarily using the tools of structural proof theory.