Co-total Enumeration Degrees

  • Boris Solon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)


This paper is dedicated to the study of the enumeration degrees which contain sets the complements of which are the graphs of some total functions. Such e-degrees are called co-total. That every total e-degree a0 e contains such total function f that \({\rm deg}_e(\overline{{\rm graph}(f)})\) is a quasi-minimal e-degree has been proved. Some known results of McEvoy and Gutteridge with the aid of co-total e-degrees become stronger as well.


Initial Segment Partial Function Computable Function Total Function Minimal Pair 
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.


  1. 1.
    Arslanov, M.M., Cooper, S.B., Kalimullin, I.S.: The properties of the splitting of total e-degrees. Algebra i Logica 43, 1–25 (2003)CrossRefMATHGoogle Scholar
  2. 2.
    Case, J.: Enumeration reducibility and partial degreees. Annals Math. Logic 2, 419–439 (1971)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Fridberg, R., Rogers, H.: Reducibility and completness for sets of integers. Z. math. Logic Grundl. Math. 5, 117–125 (1959)CrossRefGoogle Scholar
  4. 4.
    Gutteridge, L.: Some results on e-reducibility. Ph.D.Diss (1971)Google Scholar
  5. 5.
    McEvoy, K.: Jumps of quasi-minimal enumeration degrees. J. Symb. Logic 50, 839–848 (1985)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Medvedev Yu, T.: Degrees of difficulty of the mass problem. Dokl. Acad. Nauk SSSR 104, 501–504 (1955)MathSciNetGoogle Scholar
  7. 7.
    Pankratov, A.: The research of some properties of co-total e-degrees. In: Intern. conf. “Logic and applications”, Proceedings, Novosibirsk, vol. 79 (2000)Google Scholar
  8. 8.
    Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)MATHGoogle Scholar
  9. 9.
    Sasso, L.P.: A survey of partial degrees. J. Symb. Logic 40, 130–140 (1975)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Soar Robert, I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Boris Solon
    • 1
  1. 1.Department of MathematicsIvanovo State University of Chemistry and TechnologyRussia

Personalised recommendations