Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-27T01:36:08.681Z Has data issue: false hasContentIssue false
  • English
  • Français

Jumps of quasi-minimal enumeration degrees

Published online by Cambridge University Press:  12 March 2014

Kevin McEvoy
Kevin McEvoy*
Affiliation:
Department of Computer Studies, University of Leeds, Leeds LS2 9JT, England
Get access Rights & Permissions [Opens in a new window]

Extract

Enumeration reducibility is a reducibility between sets of natural numbers defined as follows: A is enumeration reducible to B if there is some effective operation on enumerations which when given any enumeration of B will produce an enumeration of A. One reason for interest in this reducibility is that it presents us with a natural reducibility between partial functions whose degree structure can be seen to extend the structure of the Turing degrees of unsolvability. In [7] Friedberg and Rogers gave a precise definition of enumeration reducibility, and in [12] Rogers presented a theorem of Medvedev [10] on the existence of what Case [1] was to call quasi-minimal degrees. Myhill [11] also defined this reducibility and proved that the class of quasi-minimal degrees is of second category in the usual topology. As Gutteridge [8] has shown that there are no minimal enumeration degrees (see Cooper [3]), the quasi-minimal degrees are very much of interest in the study of the structure of the enumeration degrees. In this paper we define a jump operator on the enumeration degrees which was introduced by Cooper [4], and show that every complete enumeration degree is the jump of a quasi-minimal degree. We also extend the notion of a high Turing degree to the enumeration degrees and construct a “high” quasi-minimal enumeration degree—a result which contrasts with Cooper's result in [2] that a high Turing degree cannot be minimal. Finally, we use the Sacks' Jump Theorem to characterise the jumps of the co-r.e. enumeration degrees.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 50 , Issue 3 , September 1985 , pp. 839 - 848
Copyright
Copyright © Association for Symbolic Logic 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Case, J., Enumeration reducibility and partial degrees, Annals of Mathematical Logic, vol. 2 (1971), pp. 419–439.CrossRefGoogle Scholar
[2]Cooper, S. B., Minimal degrees and the jump operator, this Journal, vol. 38 (1973), pp. 249–271.Google Scholar
[3]Cooper, S. B., Partial degrees and the density problem, this Journal, vol. 47 (1982), pp. 854–859.Google Scholar
[4]Cooper, S. B., Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense, this Journal, vol. 49 (1984), pp. 503–513.Google Scholar
[5]Epstein, R. L., Degrees of unsohability: Structure and theory, Lecture Notes in Mathematics, vol. 759, Springer-Verlag, Berlin, 1979.CrossRefGoogle Scholar
[6]Friedberg, R., A criterion for completeness of degrees of unsohability, this Journal, vol. 22 (1957), pp. 159–160.Google Scholar
[7]Friedberg, R. and Rogers, H. Jr., Reducibility and completeness for sets of integers, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125.CrossRefGoogle Scholar
[8]Gutteridge, L., Some results on enumeration reducibility, Ph.D. Disseration, Simon Fraser University, Burnaby, 1971. (Abstract: Dissertation Abstracts International, vol. 33B (1972), pp. 319B–320B.)Google Scholar
[9]Jockusch, C. G. Jr., Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 420–436.CrossRefGoogle Scholar
[10]Medvedev, Yu. T., Degrees of difficulty of the mass problem (Russian), Doklady Akademii Nauk SSSR, vol. 104 (1955), pp. 501–504.Google Scholar
[11]Myhill, J., Note on degrees of partial functions, Proceedings of the American Mathematical Society, vol. 12 (1961), pp. 519–521.CrossRefGoogle Scholar
[12]Rogers, H. Jr., Theory of recursive functions and effective computahility, McGraw-Hill, New York, 1967.Google Scholar
[13]Sacks, G. E., Recursive enumerability and the jump operator, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 223–239.CrossRefGoogle Scholar
[14]Soare, R. I., The infinite injury priority method, this Journal, vol. 41 (1976), pp. 513–530.Google Scholar
[15]Soare, R. I., Recursively enumerable sets and degrees, Omega Series in Logic, Springer-Verlag, Berlin (to appear).CrossRefGoogle Scholar
[16]Spector, C., On degrees of recursive unsohability, Annals of Mathematics, ser. 2, vol. 64 (1956), pp. 581–592.CrossRefGoogle Scholar
[17]Shoenfield, J. R., On degrees of unsotvability, Annals of Mathematics, ser. 2, vol. 69 (1959), pp. 644–653.CrossRefGoogle Scholar