w tt-Complete Sets are not Necessarily tt-Complete

DOI10.2307/2040278zbMATH Open0311.02048OpenAlexW2048876393MaRDI QIDQ4068709FDOQ4068709

Authors: 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)

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068709)