Skip to main content
SpringerLink
Log in

Precompletely enumerated sets

  • Remark Section
  • 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. Yu. L. Ershov, Theory of Enumerations [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  2. D. Lacombe, “Recursion theoretic structure for relational systems,” in: Logic Colloquium 69, North-Holland, Amsterdam-London (1971), pp. 3–17.

    Google Scholar 

Download references

Authors
  1. S. G. Dvornikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 20, No. 6, pp. 1303–1306, November–December, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dvornikov, S.G. Precompletely enumerated sets. Sib Math J 20, 927–929 (1979). https://doi.org/10.1007/BF00970393

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation