Notre Dame Journal of Formal Logic

Effective Domination and the Bounded Jump

Keng Meng Ng and Hongyuan Yu

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: (1) We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. (2) We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via a reduction with use bounded by an ω-c.e. function. We define several notions of a c.e. set being effectively dominant, and show that together with the bounded high sets they form a proper hierarchy.

Article information

Notre Dame J. Formal Logic, Volume 61, Number 2 (2020), 203-225.

Received: 13 February 2018
Accepted: 25 April 2019
First available in Project Euclid: 7 April 2020

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03D30: Other degrees and reducibilities
Secondary: 03D28: Other Turing degree structures

wtt-degrees dominant function bounded jump jump inversion high degrees


Ng, Keng Meng; Yu, Hongyuan. Effective Domination and the Bounded Jump. Notre Dame J. Formal Logic 61 (2020), no. 2, 203--225. doi:10.1215/00294527-2020-0005.

Export citation


  • [1] Anderson, B., and B. F. Csima. “A bounded jump for the bounded Turing degrees,” Notre Dame Journal of Formal Logic, vol. 55 (2014), pp. 245–64.
  • [2] Anderson, B., B. F. Csima, and K. M. Lange, “Bounded low and high sets,” Archive for Mathematical Logic, vol. 56 (2017), pp. 507–21.
  • [3] Csima, B. F., R. Downey, and K. M. Ng, “Limits on jump inversion for strong reducibilities,” Journal of Symbolic Logic, vol. 76 (2011), pp. 1287–96.
  • [4] Downey, R., and N. Greenberg, “A hierarchy of computably enumerable degrees,” Bulletin of Symbolic Logic, vol. 24 (2018), pp. 53–89.
  • [5] Downey, R., and N. Greenberg, A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability, vol. 385 of Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, 2020.
  • [6] Downey, R., N. Greenberg, and R. Weber, “Totally $\omega $-computably enumerable degrees and bounding critical triples,” Journal of Mathematical Logic, vol. 7 (2007), pp. 145–71.
  • [7] Downey, R., C. Jockusch, and M. Stob, “Array nonrecursive sets and multiple permitting arguments,” pp. 141–73 in Recursion Theory Week (Oberwolfach, 1989), edited by K. Ambos-Spies, G. H. Müller, and G. E. Sacks, vol. 1432 of Lecture Notes in Mathematics, Springer, Berlin, 1990.
  • [8] Downey, R., A. G. Melnikov, and K. M. Ng, “Abelian $p$-groups and the Halting problem,” Annals of Pure and Applied Logic, vol. 167 (2016), pp. 1123–38.
  • [9] Harris, K., “The effective content of classical theorems on saturated models,” Ph.D. dissertation, University of Chicago, Chicago, 2007.
  • [10] Ng, K. M., F. Stephan, Y. Yang, and L. Yu, “The computational aspects of hyperimmune-free degrees,” pp. 271–84 in Proceedings of the 12th Asian Logic Conference, edited by R. Downey, J. Brendle, R. Goldblatt, and B. Kim, World Scientific, Hackensack, NJ, 2013.
  • [11] Soare, R. I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic, Springer, Berlin, 1987.