Hostname: page-component-7479d7b7d-t6hkb Total loading time: 0 Render date: 2024-07-10T07:20:23.527Z Has data issue: false hasContentIssue false
  • English
  • Français

1-genericity in the enumeration degrees

Published online by Cambridge University Press:  12 March 2014

Kate Copestake
Kate Copestake*
Affiliation:
Department of Mathematics, University of Leeds, Leeds Ls2 9JT, England
Get access Rights & Permissions [Opens in a new window]

Extract

The structure of the Turing degrees of generic and n-generic sets has been studied fairly extensively, especially for n = 1 and n = 2. The original formulation of 1-generic set in terms of recursively enumerable sets of strings is due to D. Posner [11], and much work has since been done, particularly by C. G. Jockusch and C. T. Chong (see [5] and [6]).

In the enumeration degrees (see definition below), attention has previously been restricted to generic sets and functions. J. Case used genericity for many of the results in his thesis [1]. In this paper we develop a notion of 1-generic partial function, and study the structure and characteristics of such functions in the enumeration degrees. We find that the e-degree of a 1-generic function is quasi-minimal. However, there are no e-degrees minimal in the 1-generic e-degrees, since if a 1-generic function is recursively split into finitely or infinitely many parts the resulting functions are e-independent (in the sense defined by K. McEvoy [8]) and 1-generic. This result also shows that any recursively enumerable partial ordering can be embedded below any 1-generic degree.

Many results in the Turing degrees have direct parallels in the enumeration degrees. Applying the minimal Turing degree construction to the partial degrees (the e-degrees of partial functions) produces a total partial degree ae which is minimal-like; that is, all functions in degrees below ae have partial recursive extensions.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 53 , Issue 3 , September 1988 , pp. 878 - 887
Copyright
Copyright © Association for Symbolic Logic 1988

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., Partial degrees and the density problem, this Journal, vol. 47 (1982), pp. 854–859.Google Scholar
[3]Feferman, S., Some applications of the notions of forcing and generic sets, Fundamenta Mathematicae, vol. 56 (1965), pp. 325–345.CrossRefGoogle Scholar
[4]Haught, C., Turing and truth table degrees of 1-generic and recursively enumerable sets, Ph. D. thesis, Cornell University, Ithaca, New York, 1985.Google Scholar
[5]Jockusch, C. G. and Chong, C. T., Minimal degrees and 1-generic sets below 0′, Computation and proof theory (proceedings of Logic Colloquium '83), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, Berlin, 1984, pp. 66–77.Google Scholar
[6]Jockusch, C. G., Degrees of generic sets, Recursion theory: its generalizations and applications (proceedings of Logic Colloquium '79; Drake, F. R. and Wainer, S. S., editors), London Mathematical Society Lecture Note Series, vol. 45, Cambridge University Press, Cambridge, 1980, pp. 110–139.CrossRefGoogle Scholar
[7]Lagemann, J., Embedding theorems in the reducibility ordering of the partial degrees, Ph. D. thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1972.Google Scholar
[8]McEvoy, K., On the structure of the enumeration degrees, Ph. D. thesis, University of Leeds, Leeds, 1984.Google Scholar
[9]McEvoy, K., Jumps of quasi-minimal enumeration degrees, this Journal, vol. 50 (1985), pp. 839–848.Google Scholar
[10]McEvoy, K. and Cooper, S. B., On minimal pairs of enumeration degrees, this Journal, vol. 50 (1985), pp. 983–1001.Google Scholar
[11]Posner, D., High degrees, Ph. D. thesis, University of California, Berkeley, California, 1977.Google Scholar
[12]Soare, R. I., Recursively enumerable sets and degress, Springer-Verlag, Berlin (to appear).Google Scholar
[13]Rozinas, M. G., Partial degrees of immune and hyperimmune sets, Sibirskiǐ Matematicheskiǐ Zhurnal, vol. 19 (1978), pp. 866–870; English translation, Siberian Mathematical Journal, vol. 19 (1978), pp. 613–616.Google Scholar