We determine the strictly positive fragment of the quantified provability logic of Heyting Arithmetic. We show that is decidable and that it coincides with , which is the strictly positive fragment of the quantified provability logic of of Peano Arithmetic. This positively resolves a previous conjecture of the authors. On our way to proving these results, we carve out the strictly positive fragment of the provability logic of Heyting Arithmetic, provide a simple axiomatization, and prove it to be sound and complete for two types of arithmetical interpretations. The simple fragments presented in this paper should be contrasted with a 2022 result by Mojtahedi, where an axiomatization for is provided. This axiomatization, although decidable, is of considerable complexity.

生成讲解博客的中文版本

生成AI智能校验的中文版本