w tt-Complete Sets are not Necessarily tt-Complete

DOI10.2307/2040278zbMath0311.02048OpenAlexW2048876393MaRDI QIDQ4068709

Alistair H. Lachlan

Publication date: 1975

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2040278

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (8)

One strengthening of \(Q\)-reducibility ⋮ Irreducible, singular, and contiguous degrees ⋮ Kolmogorov entropy in the context of computability theory ⋮ Recursively enumerable bw-degrees ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Strong reducibilities ⋮ Classes bounded by incomplete sets

This page was built for publication: w tt-Complete Sets are not Necessarily tt-Complete