How enumeration reducibility yields extended Harrington non-splitting
S. Barry Cooper and Mariya I. Soskova
Source: J. Symbolic Logic Volume 73, Issue 2 (2008), 634-655.
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
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1208359064
Digital Object Identifier: doi:10.2178/jsl/1208359064
Mathematical Reviews number (MathSciNet):
MR2414469
References
M. M. Arslanov, Structural properties of the degrees below $\bf 0'$, Doklady Akademii Nauk SSSR, vol. 283 (1985), pp. 270--273.
Mathematical Reviews (MathSciNet):
MR804113
M. M. Arslanov, S. B. Cooper, and I. Sh. Kalimullin, Splitting properties of total enumeration degrees, Algebra and Logic, vol. 42 (2003), pp. 1--13.
Mathematical Reviews (MathSciNet):
MR1988020
M. M. Arslanov and A. Sorbi, Relative splittings of $0'_e$ in the $\Delta_2$ enumeration degrees, Logic Colloquium'98 (S. Buss and P. Pudlak, editors), Springer-Verlag, 1999.
S. B. Cooper, On a theorem of C. E. M. Yates, 1974, handwritten notes.
--------, The strong anti-cupping property for recursively enumerable degrees, Journal of Symbolic Logic, vol. 54 (1989), pp. 527--539.
Mathematical Reviews (MathSciNet):
MR997886
Digital Object Identifier: doi:10.2307/2274867
Project Euclid: euclid.jsl/1183742924
--------, Enumeration reducibility, nondeterministic computations and relative computability of partial functions, Recursion Theory Week, Proceedings Oberwolfach 1989 (K. Ambos-Spies, G. H. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1432, Springer-Verlag, 1990, pp. 57--110.
Mathematical Reviews (MathSciNet):
MR1071514
Zentralblatt MATH:
0707.03034
Digital Object Identifier: doi:10.1007/BFb0086114
--------, Computability Theory, Chapman & Hall/CRC Mathematics, 2004.
Mathematical Reviews (MathSciNet):
MR2017461
Zentralblatt MATH:
1041.03001
S. B. Cooper, A. Sorbi, A. Li, and Y. Yang, Bounding and nonbounding minimal pairs in the enumeration degrees, Journal of Symbolic Logic, vol. 70 (2005), pp. 741--766.
Mathematical Reviews (MathSciNet):
MR2155264
Digital Object Identifier: doi:10.2178/jsl/1122038912
Project Euclid: euclid.jsl/1122038912
R. G. Downey, $\Delta^0_2$ degrees and transfer theorems, Illinois Journal of Mathematics, vol. 31 (1987), pp. 419--427.
Mathematical Reviews (MathSciNet):
MR892177
L. Harrington, Understanding Lachlan's monster paper, 1980, handwritten notes.
A. H. Lachlan, A recursively enumerable degree which will not split over all lesser ones, Annals of Mathematical Logic, vol. 9 (1975), pp. 307--365.
Mathematical Reviews (MathSciNet):
MR409150
A. H. Lachlan and R. A. Shore, The n-rea enumeration degrees are dense, Archive for Mathematical Logic, vol. 31 (1992), pp. 277--285.
Mathematical Reviews (MathSciNet):
MR1155038
Digital Object Identifier: doi:10.1007/BF01794984
D. Miller, High recursively enumerable degrees and the anti-cupping property, Logic Year 1979--80: University of Connecticut (M. Lerman, J. H. Schmerl, and R. I. Soare, editors), Lecture Notes in Mathematics, vol. 859, Springer-Verlag, 1981.
Mathematical Reviews (MathSciNet):
MR619872
P. G. Odifreddi, Classical Recursion Theory, Volume II, North-Holland/Elsevier, 1999.
Mathematical Reviews (MathSciNet):
MR1718169
D. B. Posner and R. W. Robinson, Degrees joining to $\bf 0'$, Journal of Symbolic Logic, vol. 46 (1981), pp. 714--722.
Mathematical Reviews (MathSciNet):
MR641485
Digital Object Identifier: doi:10.2307/2273221
Project Euclid: euclid.jsl/1183740882
G. E. Sacks, On the degrees less than $\bf 0'$, Annals of Mathematics, vol. 77 (1963), no. 2, pp. 211--231.
Mathematical Reviews (MathSciNet):
MR146078
Digital Object Identifier: doi:10.2307/1970214
JSTOR: links.jstor.org
T. A. Slaman and J. R. Steel, Complementation in the Turing degrees, Journal of Symbolic Logic, vol. 54 (1989), pp. 160--176.
Mathematical Reviews (MathSciNet):
MR987329
Digital Object Identifier: doi:10.2307/2275022
Project Euclid: euclid.jsl/1183742858
R. I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag, 1987.
Mathematical Reviews (MathSciNet):
MR882921
