On the connections between $wtt$- and $Q$-reducibilities

DOI10.1093/LOGCOM/EXY036zbMath1444.03136OpenAlexW2914327015MaRDI QIDQ3120202

Roland Sh. Omanadze

Publication date: 1 March 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exy036

zbMATH Keywords

computably enumerable sets\(Q\)-degree\textit{wtt}-degree\textit{bsQ}-degree\textit{bwtt}-degree\textit{sQ}-degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

This page was built for publication: On the connections between $wtt$- and $Q$-reducibilities