We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes , , and of formulas of modal arithmetic, and study basic properties of them. Then, we prove several implications between the properties. In particular, among other things, we prove that for any consistent recursively enumerable extension of with , the -disjunction property, the -existence property, and the -existence property are pairwise equivalent. Moreover, we introduce the notion of the -soundness of theories, and prove that for any consistent recursively enumerable extension of , the modal disjunction property is equivalent to the -soundness.

生成讲解博客的中文版本

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