Unifying Sequent Systems for G\"odel-L\"ob Provability Logic via Syntactic Transformations

We demonstrate the inter-translatability of proofs between the most prominent sequent-based formalisms for Gödel-Löb provability logic.

In particular, we consider Sambin and Valentini's sequent system GLseq, Shamkanov's non-wellfounded and cyclic sequent systems GL$\infty$ and GLcirc, Poggiolesi's tree-hypersequent system CSGL$^{*}$, and Negri's labeled sequent system G3KGL.

Shamkanov provided proof-theoretic correspondences between GLseq, GL$\infty$, and GLcirc, and Goré and Ramanayake showed how proofs could be transformed between CSGL$^{*}$ and G3KGL; however, the exact nature of proof transformations between the former three systems and the latter two systems has remained an open problem.

We solve this open problem by showing how to restructure tree-hypersequent proofs into an end-active form and introduce a novel 'linearization technique' that transforms such proofs into linear nested sequent proofs.

As a result, we obtain a new proof-theoretic tool for extracting linear nested sequent systems from tree-hypersequent systems, which yields the first cut-free linear nested sequent calculus LNGL for Gödel-Löb provability logic.

We show how to transform proofs in LNGL into a certain normal form, where proofs repeat in stages of modal and local rule applications, and which are translatable into GLseq and G3KGL proofs.

These new syntactic transformations, together with those mentioned above, establish full proof-theoretic correspondences between GLseq, GL$\infty$, GLcirc, CSGL$^{*}$, G3KGL, and LNGL while also giving (to the best of the author's knowledge) the first constructive proof mappings between structural (viz. labeled, tree-hypersequent, and linear nested sequent) systems and a cyclic sequent system.