Algebra and Logic

, Volume 23, Issue 4, pp 273–281 | Cite as

e - ands -degrees

  • S. D. Zakharov


Mathematical Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    E. A. Polyakov and M. G. Rozinas, Theory of Algorithms [in Russian], Ivanovo State Univ. (1976).Google Scholar
  2. 2.
    H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).Google Scholar
  3. 3.
    C. G. Jockusch, "Semirecursive sets and positive reducibility," Trans. Am. Math. Soc.,131, No. 2, 420–436 (1968).Google Scholar
  4. 4.
    R. Sh. Omanadze, "On the upper semilattice of recursively enumerable Q-degrees," Algebra Logika,23, No. 2, 175–184 (1984).Google Scholar

Copyright information

© Plenum Publishing Corporation 1985

Authors and Affiliations

  • S. D. Zakharov

There are no affiliations available

Personalised recommendations