Co-total enumeration degrees

  • Authors:

  • Boris Solon

  • Affiliations:

  • Department of Mathematics, Ivanovo State University of Chemistry and Technology

  • Venue:
  • CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 a≥0′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.