Skip to main content Accessibility help
×
×
Home

A set with barely degree

  • Rod Downey (a1), Geoffrey Laforte (a2) and Steffen Lempp (a3)
Abstract

We construct a degree which fails to be computably enumerable in any computably enumerable set strictly below .

Copyright
References
Hide All
[1]Arslanov, M., LaForte, G., and Slaman, T., Relative enumerability in the difference hierarchy, this Journal.
[2]Downey, R., The 0‴ priority method with special attention to density results, Recursion theory week: Proceedings, Oberwohlfach 1989 (Ambos-Spies, K.et al., editors), Springer, Berlin, 1990.
[3]Sacks, G., Recursive enumerability and the jump operator, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 223239.
[4]Shore, R., A non-inversion theorem for the jump operator, Annals of Pure and Applied Logic, vol. 40 (1988), pp. 277303.
[5]Soare, R., Recursively enumerable sets and degrees, Springer, Berlin, 1987.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed