Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
From MaRDI portal
Publication:542199
DOI10.1007/s11202-010-0111-7zbMath1221.03038OpenAlexW2027313289MaRDI QIDQ542199
Publication date: 8 June 2011
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11202-010-0111-7
Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)
Related Items
Cites Work