On strongly jump traceable reals

Annals of Pure and Applied Logic 154 (1):51-69 (2008)
  Copy   BIBTEX

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 image-complete

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2007.11.014

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,462

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Lowness properties and approximations of the jump.Santiago Figueira, André Nies & Frank Stephan - 2008 - Annals of Pure and Applied Logic 152 (1):51-66.
Strong Jump-Traceability.Noam Greenberg & Dan Turetsky - 2018 - Bulletin of Symbolic Logic 24 (2):147-164.
A random set which only computes strongly jump-traceable C.e. Sets.Noam Greenberg - 2011 - Journal of Symbolic Logic 76 (2):700 - 718.
A classification of low c.e. sets and the Ershov hierarchy.Marat Faizrahmanov - forthcoming - Mathematical Logic Quarterly.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.
Effective Domination and the Bounded Jump.Keng Meng Ng & Hongyuan Yu - 2020 - Notre Dame Journal of Formal Logic 61 (2):203-225.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
2-Minimality, jump classes and a note on natural definability.Mingzhong Cai - 2014 - Annals of Pure and Applied Logic 165 (2):724-741.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.

Analytics

Added to PP
2013-12-26

Downloads
20 (#921,196)

6 months
5 (#896,806)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Strong Jump-Traceability.Noam Greenberg & Dan Turetsky - 2018 - Bulletin of Symbolic Logic 24 (2):147-164.
Computing from projections of random points.Noam Greenberg, Joseph S. Miller & André Nies - 2019 - Journal of Mathematical Logic 20 (1):1950014.

Add more citations

References found in this work

[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Computational randomness and lowness.Sebastiaan Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
Lowness properties and approximations of the jump.Santiago Figueira, André Nies & Frank Stephan - 2008 - Annals of Pure and Applied Logic 152 (1):51-66.
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.

View all 10 references / Add more references