We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...