Beyond strong jump traceability

DOI10.1112/PLMS/PDQ023MaRDI QIDQ3084579zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng

Publication date 25 March 2011

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

Full work available at URL https://doi.org/10.1112/plms/pdq023

zbMATH Keywords

\(K\)-trivialitylownessrelativizationstrong jump traceability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Strong jump-traceability. II: K-triviality
• Strong jump-traceability. I: The computably enumerable case
• Strong jump-traceability
• Inherent enumerability of strong jump-traceability
• Characterizing the strongly jump-traceable sets via randomness

Cited in

(6)

• Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
• Lowness for Demuth Randomness
• 𝐾-trivial degrees and the jump-traceability hierarchy
• Strong jump-traceability. II: K-triviality
• Strong jump-traceability
• On strongly jump traceable reals

This page was built for publication: Beyond strong jump traceability

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