Skip to main content
Log in

Strong and weak constructivization and computable families

  • Published:
Algebra and Logic Aims and scope

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, "Constructive models," in: Selected Questions of Algebra and Logic [in Russian], Novosibirsk (1973), pp. 111–130.

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

  3. A. I. Mal'tsev, "Constructive algebras," Uspekhi Matem. Nauk,16, No. 3, 3–60 (1961).

    Google Scholar 

  4. A. I. Mal'tsev, "On recursive Abelian groups," Dokl. Akad. Nauk,146, No. 5, 1009–1012 (1962).

    Google Scholar 

  5. A. T. Nurtazin, "Category theory without principal model-complete extensions," Algebra i Logika,12, No. 3, 360 (1973).

    Google Scholar 

  6. L. A. Harrington, "Structures with rec. presentation," Notes Am. Math., Soc.,18, No. 5, 826 (1971).

    Google Scholar 

  7. R. L. Vaught, "Denumerable models of complete theories, infinistic methods," in: Proceedings of the Symposium on the Foundations of Mathematics, Warsaw (1961), pp. 303–321.

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 13, No. 3, pp. 311–323, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nurtazin, A.T. Strong and weak constructivization and computable families. Algebra and Logic 13, 177–184 (1974). https://doi.org/10.1007/BF01463352

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation