The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986)

A modal logic that can decide questions involving provability and interpretability over the arithmetical theories PRA and I\(\Sigma_1\) is considered. The full provability logic of PRA with a constant for I\(\Sigma_1\) was already determined by \textit{L.\ D.\ Beklemishev} [J Symb. Log. 61, 91--124 (1996; Zbl 0858.03024)]. The author considers PGL, the closed fragment of the provability logic of PRA with a constant for I\(\Sigma_1\) (i.e.\ for the single sentence axiomatizing the theory I\(\Sigma_1),\) and PIL, the closed fragment of the interpretability logic. The normal form theorem, arithmetical soundness and completeness theorems are proved. The author constructs Kripke and Veltman universal models of the logics PGL and PIL. It is shown that these logics are decidable.