| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662216 | Annals of Pure and Applied Logic | 2008 | 19 Pages |
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 -complete.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
