Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-26T13:22:42.001Z Has data issue: false hasContentIssue false
  • English
  • Français

The index set {e: We ≡1X}.

Published online by Cambridge University Press:  12 March 2014

E. Herrmann
E. Herrmann*
Affiliation:
Sektion Mathematik, Humboldt-Universität, Berlin, DDR
Get access Rights & Permissions [Opens in a new window]

Abstract

Let X be any infinite, coinfinite r.e. set. We show that the index set {e: We ≡1X) is -complete, answering a question posed by Odifreddi in [2].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 51 , Issue 1 , March 1986 , pp. 110 - 116
Copyright
Copyright © Association for Symbolic Logic 1986

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]Herrmann, E., Orbits of hyperhypersimple sets and the lattice of -sets, this Journal, vol. 48 (1983), pp. 693–699.Google Scholar
[2]Odifreddi, P., Strong reducibilities, Bulletin (New Series) of the American Mathematical Society, vol. 4 (1981), pp. 37–86.Google Scholar
[3]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1965.Google Scholar