Skip to main content
SpringerLink
Log in

Enumerations of simple models

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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 completely decidable theories,” Algebra Logika,12, No. 2, 125–142 (1973).

    Google Scholar 

  2. Yu. L. Ershov, Enumeration Theory [in Russian], No. 3, Novosibirsk. Univ., Novosibirsk (1974).

    Google Scholar 

  3. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  4. M. G. Peretyat'kin, “Strongly constructuve models and enumeration of Boolean algebras of recursive sets,” Algebra Logika,10, No. 5, 535–557 (1971).

    Google Scholar 

  5. S. S. Goncharov, “Some properties of constructivization of Boolean algebras,” Sib. Mat. Zh.,16, No. 2, 264–278 (1975).

    Google Scholar 

Download references

Authors
  1. B. N. Drobotun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 5, pp. 1002–1014, September–October, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drobotun, B.N. Enumerations of simple models. Sib Math J 18, 707–716 (1977). https://doi.org/10.1007/BF00967009

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation