加载中…
We investigate the arithmetical completeness theorems of some extensions of Fitting, Marek, and Truszczyński’s pure logic of necessitation . For , let , which was introduced by Kurahashi and Sato, be the logic obtained from by adding the axiom scheme . In this paper, among other things, we prove that for each , the logic becomes a provability logic, that is, there exists a provability predicate of whose -verifiable modal principles are exactly the logic .

生成讲解博客的中文版本

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