加载中…
In this paper we consider some fragments of (Robinson arithmetic with induction for quantifier-free formulas) proposed by Harvey Friedman and answer some questions he asked about these theories. We prove that is equivalent to and is not finitely axiomatizable over , establish some inclusion relations between and . We also prove that the set of diophantine equations solvable in models of is (algorithmically) decidable.

生成讲解博客的中文版本

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