加载中…
For a class of formulas, local reflection principle for a theory of arithmetic is a scheme formalizing the -soundness of . Beklemishev proved that for every , the full local reflection principle is -conservative over . We firstly generalize the conservation theorem to nonstandard provability predicates: we prove that the second condition of the derivability conditions is a sufficient condition for the conservation theorem to hold. We secondly investigate the conservation theorem in terms of Rosser provability predicates. We construct Rosser predicates for which the conservation theorem holds and Rosser predicates for which the theorem does not hold.

生成讲解博客的中文版本

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