Abstract
In this article, we show that there exist c.e. bounded Turing degrees \(\textbf{a}\), \(\textbf{b}\) such that 0 < a < 0 ′, and that for any c.e. bounded Turing degree \(\textbf{x}\), \({\bf b\lor x=0^{'}}\) if and only if \(\textbf{x}\geq\textbf{a}\). The result gives an unexpected definability theorem in the structure of bounded Turing reducibilities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambos-Spies, K., Fejer, P.A., Lempp, S., Lerman, M.: Decidability of the two-quantifier theory of the recursively enumerable weak truthtable degrees and other distributive upper semi-lattices. Journal of Symbolic Logic 61, 880–905 (1996)
Ambos-Spies, K., Lachlan, A.H., Soare, R.I.: The continuity of cupping to 0’. Annals of Pure and Applied Logic 64, 195–209 (1993)
Brodhead, P., Li, A., Li, W.: Continuity of capping in ε dT (to appear)
Cooper, S.B., Li, A.: On Lachlan’s major subdegree problem (to appear)
Harrington, L., Soare, R.I.: Games in recursion theory and continuity properties of capping degrees. In: Judah, H., Just, W., Woodin, W.H. (eds.) Set Theory and the Continuum, Proceedings of Workshop on Set Theory and the Continuum, MSRI, Berkeley, CA, October, 1989, pp. 39–62. Springer, Heidelberg (1992)
Nies, A., Lempp, S.: The undecidability of the Π 4-theory for the r.e. wtt- and Turing degrees. Journal of Symbolic Logic 60, 1118–1136 (1995)
Nies, A., Lempp, S., Slaman, T.A.: The Π 3-theory of the enumerable Turing degrees is undecidable. Transactions of the American Mathematical Society 350, 2719–2736 (1998)
Seetapun, D.: Contributions to Recursion Theory, Ph. D thesis, Trinity College (1991)
Soare, R.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Soare, R.I.: Computability Theory and Applications. Springer, Heidelberg (to appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, A., Li, W., Pan, Y., Tang, L. (2008). Definable Filters in the Structure of Bounded Turing Reductions. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)