Skip to main content
Log in

Theory of Abelian groups with constructive models

  • 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

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

Instant access to the full article PDF.

Literature Cited

  1. Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  2. Yu. L. Ershov, “Constructive models,” in: Selected Problems in Algebra and Logic [in Russian], Nauka, Novosibirsk (1973), pp. 11–130.

    Google Scholar 

  3. Yu. L. Ershov, “Skolem functions and constructive models,” Algebra Logika,12, No. 6, 644–654 (1973).

    Google Scholar 

  4. M. G. Peretyat'kin, “Every recursively enumerable extension of a theory of linear order has a constructive model,” Algebra Logika,12, No. 2, 211–219 (1973).

    Google Scholar 

  5. M. Lerman and J. H. Schmerl, “Theories with recursive models,” J. Symbolic Logic,44, No. 1, 59–76 (1979).

    Google Scholar 

  6. S. S. Goncharov, “A totally transcendental theory with a nonconstructible prime model,” Sib. Mat. Zh.,21, No. 1, 44–51 (1980).

    Google Scholar 

  7. S. S. Goncharov and A. T. Nurtazin, “Constructive models of complete decidable theories,” Algebra Logika,12, No. 2, 125–142 (1973).

    Google Scholar 

  8. S. S. Goncharov, “Strong constructibility of homogeneous models,” Algebra Logika,17, No. 4, 363–388 (1978).

    Google Scholar 

  9. M. G. Peretyat'kin, “A criterion of strong constructibility of homogeneous models,” Algebra Logika,17, No. 4, 430–454 (1978).

    Google Scholar 

  10. A. S. Morozov, “Strong constructibility of countable saturated Boolean algebras,” Algebra Logika,21, No. 2, 193–203 (1982).

    Google Scholar 

  11. J. Mead, “Recursive prime models for Boolean algebras,” Colloq. Math.,41, No. 1, 25–33 (1979).

    Google Scholar 

  12. A. S. Morozov, “Countable homogeneous Boolean algebras,” Algebra Logika,21, No. 3, 269–282 (1982).

    Google Scholar 

  13. M. I. Kargapolov and Yu. I. Merzlyakov, Foundations of Group Theory [in Russian], 3rd ed., Nauka, Moscow (1982).

    Google Scholar 

  14. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  15. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  16. A. I. Mal'tsev, “Recursive Abelian groups,” Dokl. Akad. Nauk SSSR,146, No. 5, 1009–1012 (1962).

    Google Scholar 

  17. M. G. Peretyat'kin, “Strongly constructive models and enumerations of the Boolean algebra of recursive sets,” Algebra Logika,10, No. 5, 535–557 (1971).

    Google Scholar 

  18. A. V. Molokov, “Prime models of a theory of Abelian groups,” in: Sixth All-Union Conference on Mathematical Logic [in Russian], Tbilisi (1982), p. 116 (Thesis).

  19. R. Deissler, “Minimal and prime models of complete theories for torsion-free Abelian groups,” Alg. Univ.,9, No. 2, 250–265 (1979).

    Google Scholar 

  20. N. G. Khisamiev, “Strongly constructive Abelian p-groups,” Algebra Logika,22, No. 2, 198–217 (1983).

    Google Scholar 

  21. P. C. Eklof and E. R. Fischer, “The elementary theory of Abelian groups,” Ann. Math. Logic,4, No. 2, 115–171 (1972).

    Google Scholar 

Download references

Authors

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 27, No. 4, pp. 128–143, July–August, 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khisamiev, N.G. Theory of Abelian groups with constructive models. Sib Math J 27, 572–585 (1986). https://doi.org/10.1007/BF00969170

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation