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

Solvability of the∀∃-theory of a certain factor-lattice of recursively enumerable sets

  • 14 Accesses

  • 3 Citations

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

Literature Cited

  1. 1.

    Yu. L. Ershov, E. A. Palyutin, and M. A. Taitslin, Mathematical Logic [in Russian], Novosibirsk State Univ., Novosibirsk (1973).

  2. 2.

    A. H. Lachlan, "On the lattice of resursively enumerable sets," Trans. Am. Math. Soc.,130, No. 1, 1–37 (1968).

Download references

Additional information

Translated from Algebra i Logika, Vol. 17, No. 2, pp. 134–143, March–April, 1978.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Degtev, A.N. Solvability of the∀∃-theory of a certain factor-lattice of recursively enumerable sets. Algebra and Logic 17, 94–101 (1978). https://doi.org/10.1007/BF01670108

Download citation

Keywords

  • Mathematical Logic