Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Strongly constructive models and numerations of the Boolean algebra of recursive sets

  • 15 Accesses

  • 28 Citations

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

Literature cited

  1. 1.

    Yu. L. Ershov, “Constructive models,” [in Russian], unpublished manuscript.

  2. 2.

    Yu. L. Ershov, “Decidability of the elementary theory of distributive structures with complementation relations and of the theory of filters,” Alg. i Logika,3, No. 3, 17–38 (1964).

  3. 3.

    R. Sikorskii, Boolean Algebra [in Russian], Mir (1969).

  4. 4.

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

  5. 5.

    A. I. Mal'tsev, “Constructive algebras, 1,” Uspekh. Matem. Nauk,16, No. 3, 3–60 (1961).

Download references

Additional information

Translated from Algebra i Logika, Vol. 10, No. 5, pp. 535–557, September–October, 1971.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Peretyat'kin, M.G. Strongly constructive models and numerations of the Boolean algebra of recursive sets. Algebr Logic 10, 332–345 (1971). https://doi.org/10.1007/BF02219840

Download citation

Keywords

  • Mathematical Logic
  • Boolean Algebra
  • Constructive Model