|
Minimal degrees which are but not
Author(s):
Richard
A.
Shore
Journal:
Proc. Amer. Math. Soc.
132
(2004),
563-565.
MSC (2000):
Primary 03D28
Posted:
June 17, 2003
Retrieve article in:
PDF
Abstract |
References |
Similar articles |
Additional information
Abstract:
We give a short proof of the existence of minimal Turing degrees which are but not .
References:
- 1.
- Friedman, Harvey, One hundred and two problems in mathematical logic. J. Symbolic Logic 40(1975), 113-129. MR 51:5254
- 2.
- Friedman, Harvey, Recursiveness in
paths through . Proc. Amer. Math. Soc. 54(1976), 311-315. MR 53:2663 - 3.
- Goncharov, S. S., Harizanov, V. S., Knight, J. and Shore, R. A.,
relations and paths through , in preparation. - 4.
- Jockusch, Carl G. Jr., Recursiveness of initial segments of Kleene's
. Fund. Math. 87(1975), 161-167. MR 58:189 - 5.
- Jockusch, Carl G. Jr. and Soare, Robert I.,
classes and degrees of theories. Trans. Amer. Math. Soc. 173(1972), 33-56. MR 47:4775 - 6.
- Jockusch, Carl G. Jr. and Soare, Robert I., Degrees of members of
classes. Pacific J. Math. 40(1972), 605-616. MR 46:8827 - 7.
- Lachlan, A. H., Solution to a problem of Spector. Canad. J. Math. 23(1971), 247-256. MR 47:6460
- 8.
- Manaster, Alfred B., Some contrasts between degrees and the arithmetical hierarchy. J. Symbolic Logic 36(1971), 301-304. MR 44:3867
- 9.
- Lerman, Manuel I., Degrees of unsolvability. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
- 10.
- Sasso, Leonard P., A cornucopia of minimal degrees. J. Symbolic Logic 35(1970), 383-388. MR 44:69
- 11.
- Soare, Robert I., Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. MR 88m:03003
Similar Articles:
Retrieve articles in Proceedings of the American Mathematical Society
with MSC
(2000):
03D28
Retrieve articles in all Journals with MSC
(2000):
03D28
Additional Information:
Richard
A.
Shore
Affiliation:
Department of Mathematics, Cornell University, Ithaca, New York 14853
Email:
shore@math.cornell.edu
DOI:
10.1090/S0002-9939-03-07080-1
PII:
S 0002-9939(03)07080-1
Keywords:
Minimal degree,
recursively enumerable in $0'$
Received by editor(s):
August 19, 2002
Received by editor(s) in revised form:
October 8, 2002
Posted:
June 17, 2003
Additional Notes:
This research was partially supported by NSF Grant DMS-0100035
Communicated by:
Carl G. Jockusch, Jr.
Copyright of article:
Copyright
2003,
American Mathematical Society
|