Skip to main content
Log in

e-immune sets

  • 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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Rogers H., Theory of Recursive Functions and Effective Computability, Mir, Moscow (1967).

    MATH  Google Scholar 

  2. Medvedev Yu. T., “Degrees of complexity of mass problems,” Dokl. Akad. Nauk SSSR,104, 501–504 (1955).

    MATH  Google Scholar 

  3. Case J., “Enumeration reducibility and partial degress,” Ann. Math. Logic,4, 419–439 (1971).

    Article  Google Scholar 

  4. Sasso L. P., “A survey of partial degrees,” J. Symbolic Logic,40, 130–140 (1975).

    Article  MATH  Google Scholar 

  5. Solon B. Ya., “E-Hyperimmune sets,” Sibirsk. Mat. Zh.,33, No. 2, 211–214 (1992).

    Google Scholar 

  6. Rozinas M. G., “Partial degrees of immune and hyperimmune sets,” Sibirsk. Mat. Zh.,19, No. 5, 866–870 (1978).

    MATH  Google Scholar 

  7. Skordev S. D., “On partial conjunctive reducibility,” in: Abstracts: 2 All-Union Conference on Mathematical Logic, Moscow, 1972, pp. 43–44.

  8. Zakharov S. D., “On the intrinsic structure ofe-degrees,” in: Abstracts: 9 All-Union Conference on Mathematical Logic, Leningrad, 1988, pp. 61.

Download references

Authors

Additional information

Ivanovo. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 41, No. 3, pp. 676–691, May–June, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solon, B.Y. e-immune sets. Sib Math J 41, 563–574 (2000). https://doi.org/10.1007/BF02674112

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation