Skip to main content
SpringerLink
Log in

Decidability of certain theories of integers

  • Brief Communications
  • 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.

Institutional subscriptions

Literature Cited

  1. Yu. L. Ershov, “Undecidability of certain fields,” Dokl. Akad. Nauk SSSR,161, No. 1, 27–29 (1965).

    Google Scholar 

  2. M. A. Taitslin, “Elementary theories of lattices,” Algebra i Logika,9, No. 4, 473–483 (1970).

    Google Scholar 

  3. Yu. G. Penzin, “Decidability of integer theories with addition, order, and predicates identifying a chain of subgroups,” Proc. Eleventh All-Union Algebra Colloquium [in Russian], Kishinev (1971), p. 165.

  4. Yu. G. Penzin, “Decidability of integer theories with addition, order, and multiplication by one arbitrary number,” Proc. Eleventh All-Union Algebra Colloquium [in Russian], Kishinev (1971).

  5. J. Robinson, “Definability and decision problems in arithmetic,” J. Symbolic Logic,14, No. 2, 98–114 (1949).

    Google Scholar 

  6. R. Robinson “Undecidable rings,” Trans. Amer. Math. Soc.,70, 1, 137–159 (1951).

    Google Scholar 

Download references

Authors
  1. Yu. G. Penzin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 14, No. 5, pp. 1139–1143, September–October, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Penzin, Y.G. Decidability of certain theories of integers. Sib Math J 14, 796–799 (1973). https://doi.org/10.1007/BF00969917

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation