Abstract
We prove that there are non-recursive r.e. sets A and C with A < T C such that for every set \( F \leqslant _{T} A,{\kern 1pt} {\kern 1pt} C \cap F \equiv _{W} \emptyset \).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Downey, R. G., Stob, M.: Structural interactions of the recursively enumerable T-and W-Degrees. Ann. Pure. Applied Logic, 31, 205–236 (1986)
Downey, R. G., Stob, M.: Splitting theorems in recursion theory. Ann. Pure. Applied Logic, 65, 1–106 (1993)
Ladner, Sasso, L. P.: The weak truth table degrees of recursively enumerable sets. Ann. Math. Logic, 8, 429–448 (1975)
Soare, R. I.: Recursively Enumerable Sets and Degrees, Perspect. Math. Logic, Springer, Berlin (1987)
Author information
Authors and Affiliations
Additional information
Both authors are supported by “863” and the National Science Foundation of China
Rights and permissions
About this article
Cite this article
Yu, L., Ding, D.C. Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees. Acta Math Sinica 20, 163–168 (2004). https://doi.org/10.1007/s10114-003-0288-9
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10114-003-0288-9