Skip to main content
SpringerLink
Log in

Decidability of extended theories of addition of the natural numbers and the integers

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. Yu. G. Penzin, “Algorithmic questions in number theory,” Algebra (Irkutsk), No. 3, 120–148 (1974).

    Google Scholar 

  2. A. A. Ivanov, “Extended theories of certain classes of Abelian groups and lattices of subgroups,” in: Fifth All-Union Conference on Mathematical Logic [in Russian], Novosibirsk (1979), p. 56.

  3. M. O. Rabin, “Definability of second-order theories and automata on infinite trees,” Trans. Am. Math. Soc.,141, 1–35 (1969).

    Google Scholar 

  4. J. R. Büchi, “Weak second-order arithmetic and finite automata,” Z. Math. Logik Grundlagen Math.,6, 66–92 (1960).

    Google Scholar 

  5. Yu. L. Ershov, I. A. Lavrov, A. D. Taimanov, and M. A. Taitslin, “Elementary theories,” Usp. Mat. Nauk,20, No. 4, 37–106 (1965).

    Google Scholar 

Download references

Authors
  1. A. A. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 25, No. 4, pp. 78–81, July–August, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, A.A. Decidability of extended theories of addition of the natural numbers and the integers. Sib Math J 25, 572–574 (1984). https://doi.org/10.1007/BF00968894

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00968894

Keywords

Search

Navigation