ON STRONGLY JUMP TRACEABLE REALS
| Citations: | 3 - 0 self |
BibTeX
@MISC{Ng_onstrongly,
author = {Keng Meng Ng},
title = {ON STRONGLY JUMP TRACEABLE REALS},
year = {}
}
OpenURL
Abstract
Abstract. In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is Π 0 4-complete. §1. Introduction. One of the fundamental concerns of computability theory is in understanding the relative difficulty of computational problems as measured by Turing reducubility (≤T). The equivalence classes of the preordering ≤T are called Turing degrees, and it is long recognized that the fundamental operator on the structure of the Turing degrees is the jump operator. For a set A, the







