Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-31T19:06:25.271Z Has data issue: false hasContentIssue false
  • English
  • Français

A high strongly noncappable degree

Published online by Cambridge University Press:  12 March 2014

Steffen Lempp
Steffen Lempp*
Affiliation:
Department of Mathematics, Yale University, New Haven, Connecticut 06520
Get access Rights & Permissions [Opens in a new window]

Abstract

An r.e. degree a ≠ 0, 0′ is called strongly noncappable if it has no inf with any incomparable r.e. degree. We show the existence of a high strongly noncappable degree.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 53 , Issue 1 , March 1988 , pp. 174 - 187
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

[AS84] Ambos-Spies, K., On pairs of recursively enumerable degrees, Transactions of the American Mathematical Society, vol. 283 (1984), pp. 507–531.Google Scholar
[Cota] Cooper, S. B., A jump class of noncappable degrees, this Journal (to appear).Google Scholar
[La66] Lachlan, A. H., Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society, ser. 3, vol. 16 (1966), pp. 537–569.CrossRefGoogle Scholar
[Sa63] Sacks, G. E., On the degrees less than 0′, Annals of Mathematics, ser. 2, vol. 77 (1963), pp. 211–231.Google Scholar
[Sa64] Sacks, G. E., The recursively enumerable degrees are dense, Annals of Mathematics, ser. 2, vol. 80 (1964), pp. 300–312.CrossRefGoogle Scholar
[Sh65] Shoenfield, J. R., Application of model theory to degrees of unsolvability, Symposium on the theory of models (Addison, J. W. et al, editors), North-Holland, Amsterdam, 1965, pp. 359–363.Google Scholar
[Shta] Shore, R. A., A noninversion theorem for the jump operator, Annals of Pure and Applied Logic (to appear).Google Scholar
[So80] Soare, R. I., Fundamental methods for constructing recursively enumerable degrees, Recursion theory: its generalizations and applications (proceedings of Logic Colloquium ’79; F. Drake, R. and Wainer, S. S., editors), London Mathematical Society Lecture Note Series, vol. 45, Cambridge University Press, Cambridge, 1980, pp. 1–51.Google Scholar
[So85] Soare, R. I., Tree arguments in recursion theory and the 0″ -priority method in recursion theory, Recursion theory (Nerode, A. and Shore, R. A., editors), Proceedings of Symposia in Pure Mathematics, vol. 42, American Mathematical Society, Providence, Rhode Island, 1985, pp. 53–106.CrossRefGoogle Scholar
[So87] Soare, R. I., Recursively enumerable sets and degrees, Springer-Verlag, Berlin, 1987.CrossRefGoogle Scholar
[Ya66] Yates, C. E. M., A minimal pair of recursively enumerable degrees, this Journal, vol. 31 (1966), pp. 159–168.Google Scholar