Skip to main content Accessibility help

Weakly semirecursive sets

  • Carl G. Jockusch (a1) and James C. Owings (a2)


We introduce the notion of “semi-r.e.” for subsets of ω, a generalization of “semirecursive” and of “r.e.”, and the notion of “weakly semirecursive”, a generalization of “semi-r.e.”. We show that A is weakly semirecursive iff, for any n numbers x1, …,xn, knowing how many of these numbers belong to A is equivalent to knowing which of these numbers belong to A. It is shown that there exist weakly semirecursive sets that are neither semi-r.e. nor co-semi-r.e. On the other hand, we exhibit nonzero Turing degrees in which every weakly semirecursive set is semirecursive. We characterize the notion “A is weakly semirecursive and recursive in K” in terms of recursive approximations to A. We also show that if a finite Boolean combination of r.e. sets is semirecursive then it must be r.e. or co-r.e. Several open questions are raised.



Hide All
[1] Beigel, R., Gasarch, W., Gill, J., and Owings, J., Terse, superterse, and verbose sets, Information and Computation (to appear).
[2] Beigel, R., Gasarch, W., and Owings, J., Nondeterministic bounded query reducibilities, Annals of Pure and Applied Logic, vol. 41 (1989), pp. 107118.
[3] Jockusch, C. G., Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 420436.
[4] Owings, J., A cardinality version of Beigel's nonspeedup theorem, this Journal, vol. 54 (1989), pp. 761767.
[5] Soare, R. I., Recursively enumerable sets and degrees, Springer-Verlag, New York, 1987.

Related content

Powered by UNSILO

Weakly semirecursive sets

  • Carl G. Jockusch (a1) and James C. Owings (a2)


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.