Nonlowness is independent from fickleness

DOI10.3233/COM-190269OpenAlexW3133114697MaRDI QIDQ5037206

Liling Ko

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-190269

zbMATH Keywords

\( \alpha \)-computably approximablearray computablecomputably enumerable sets and degreesficklenonlow

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Array nonrecursive degrees and lattice embeddings of the diamond
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• T-Degrees, Jump Classes, and Strong Reducibilities
• Recursively enumerable sets and degrees
• Contiguity and distributivity in the enumerable Turing degrees
• A Hierarchy of Turing Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonlowness is independent from fickleness