Source: J. Symbolic Logic Volume 73, Issue 4
(2008), 1407-1415.
Let A be an infinite Δ₂⁰ set and let K be creative: we show
that K≤Q A if and only if K≤Q₁ A. (Here
≤Q denotes Q-reducibility, and ≤Q₁ is
the subreducibility of ≤Q obtained by requesting that
Q-reducibility be provided by a computable function f such that
Wf(x)∩ Wf(y)=∅, if x \not= y.) Using this result we prove
that A is hyperhyperimmune if and only if no Δ⁰₂ subset B of A
is s-complete, i.e., there is no Δ⁰₂ subset B of A such
that \overline{K}≤s B, where ≤s denotes
s-reducibility, and \overline{K} denotes the complement of K.
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription.
Read more about accessing full-text
References
S. B. Cooper, Enumeration reducibility, nondeterministic computations and relative computability of partial functions, Recursion theory week, Oberwolfach 1989 (K. Ambos-Spies, G. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1432, Springer--Verlag, Heidelberg, 1990, pp. 57--110.
R. M. Friedberg and H. Rogers, Jr., Reducibility and completeness for sets of integers, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117--125.
Mathematical Reviews (MathSciNet):
MR112831
J. T. Gill III and P. H. Morris, On subcreative sets and $S$-reducibility, Journal of Symbolic Logic, vol. 39 (1974), no. 4, pp. 669--677.
Mathematical Reviews (MathSciNet):
MR363840
C. G. Jockusch, Jr., The degrees of hyperhyperimmune sets, Journal of Symbolic Logic, vol. 34 (1969), no. 3, pp. 489--493.
Mathematical Reviews (MathSciNet):
MR252224
K. McEvoy, The structure of the enumeration degrees, Ph.D. thesis, School of Mathematics, University of Leeds, 1984.
M. Morley and R. I. Soare, Splitting theorems and $\Delta_2^0$ sets, Fundamenta Mathematicae, vol. 90 (1975), pp. 45--52.
Mathematical Reviews (MathSciNet):
MR398807
R. Sh. Omanadze and A. Sorbi, Strong enumeration reducibilities, Archive for Mathematical Logic, vol. 45 (2006), no. 7, pp. 869--912.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
Mathematical Reviews (MathSciNet):
MR224462
M. G. Rozinas, Partial degrees of immune and hyperimmune sets, Siberian Mathematical Journal, vol. 19 (1978), pp. 613--616.
Mathematical Reviews (MathSciNet):
MR491101
R. I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer--Verlag, Heidelberg, 1987.
Mathematical Reviews (MathSciNet):
MR882921
V. D. Solov'ev, Q-reducibility and hyperhypersimple sets, Veroyatn. Metod. i Kibern., vol. 10--11 (1974), p. 1974, Russian.
Mathematical Reviews (MathSciNet):
MR476454