Algebraic disguises of \(\Sigma ^ 0_ 1\) induction (Q2640598)

This paper contributes new facts to the growing body of results in ``reverse mathematics'' concerned with the very weakest theories; a general description of the underlying program is found in a paper by \textit{S. G. Simpson} [Recursion theory, Proc. AMS-ASL Summer Inst., Ithaca/N. Y. 1982, Proc. Symp. Pure Math. 42, 461-471 (1985; Zbl 0578.03005)]. Many results in countable algebra were analyzed by \textit{H. Friedman}, \textit{S. G. Simpson} and \textit{R. L. Smith} [Ann. Pure Appl. Logic 25, 141-181 (1983; Zbl 0575.03038)] as to their equivalence to the set existence principles of one of the basic theories used in the program. In a paper by \textit{S. G. Simpson} and \textit{R. L. Smith} [ibid. 31, 289-306 (1986; Zbl 0603.03019)] the system \(RCA^*_ 0\) was introduced, and the authors established that the \(\Sigma\) \({}^ 0_ 1\)-induction principle is equivalent over \(RCA^*_ 0\) to a number of basic lemmas about polynomials in one variable over a countable field. In the paper under review it is proved, as the main theorem, that \(\Sigma^ 0_ 1\)- induction is equivalent over RCA\({}^*_ 0\) to the fundamental structure theorem for finitely generated abelian groups.