Skip to main content
SpringerLink
Log in

Supersets of recursively enumerable sets

  • Notes
  • 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. H. Rodgers, Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  2. D. A. Martin, “A theorem on hypersimple sets,” J. Symbolic Logic,28, 273–278 (1963).

    Google Scholar 

  3. D. A. Martin, “Classes of recursively enumerable sets and degrees of unsolvability,” Z. Math. Logik Grundl. Math.,12, No. 4, 295–310 (1966).

    Google Scholar 

  4. A. N. Degtev, “Hypersimple sets with retraceable complements,” Algebra Logika,10, No. 3, 235–246 (1971).

    Google Scholar 

  5. T. G. McLaughlin, “Retraceable sets with rapid growth,” Proc. Am. Math. Soc.,40, No. 2, 573–576 (1973).

    Google Scholar 

Download references

Authors
  1. E. Z. Dyment
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 2, pp. 462–464, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyment, E.Z. Supersets of recursively enumerable sets. Sib Math J 18, 331–332 (1977). https://doi.org/10.1007/BF00967170

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation