Skip to main content
SpringerLink
Log in

On complete theories with a finite number of denumerable models

  • 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. S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete solvable theories," Algebra i Logika,12, No. 2, 125–142 (1973).

    Google Scholar 

  2. Yu. L. Ershov, "Constructive models," in: Selected Topics in Algebra and Mathematical Logic, Novosibirsk (1972).

  3. A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka (1970).

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

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

    Google Scholar 

  6. R. L. Vaught, "Denumerable models of complete theories, Infinistic methods," Proc. Symp. Found. Math., Warsaw (1959).

Download references

Authors
  1. M. G. Peretyat'kin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 12, No. 5, pp. 550–576, September–October, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peretyat'kin, M.G. On complete theories with a finite number of denumerable models. Algebr Logic 12, 310–326 (1973). https://doi.org/10.1007/BF02218589

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation