Mathematical Logic Quarterly 59 (3):238-246 (2013)

Abstract This article has no associated abstract. (fix it)
Keywords Computably enumerable sets  bQ‐degrees  nonspeedable sets  \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mbox{be}$\end{document}‐degrees. MSC (2010) 03D25  \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mbox{bs}$\end{document}‐degrees  03D30
Categories (categorize this paper)
DOI 10.1002/malq.201200101
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,295
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Computational Complexity, Speedable and Levelable Sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

View all 8 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
9 ( #922,368 of 2,448,728 )

Recent downloads (6 months)
1 ( #447,803 of 2,448,728 )

How can I increase my downloads?


My notes