Skip to main content
SpringerLink
Log in

Strong constructivizability of countable saturated Boolean algebras

  • 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

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, "The ssolubility of the elementary theory of distrubutive structures with relative complements and theory of filters," Algebra Logika,3, No. 3, 17–38 (1964).

    Google Scholar 

  2. Yu. L. Ershov, Solubility Problems and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

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

    Google Scholar 

  4. J. Sax, The Theory of Saturated Models [Russian translation], Mir, Moscow (1976).

    Google Scholar 

  5. R. Sikorskii, Boolean Algebras [Russian translation], Mir, Moscow (1969).

    Google Scholar 

  6. S. S. Goncharov, "STrong constructivizability of homogeneous models," Algebra Logika,17, No. 4, 363–368 (1978).

    Google Scholar 

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

    Google Scholar 

Download references

Authors
  1. A. S. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 21, No. 2, pp. 193–203, March–April, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morozov, A.S. Strong constructivizability of countable saturated Boolean algebras. Algebra and Logic 21, 130–137 (1982). https://doi.org/10.1007/BF01980754

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation