Lattice embeddings and array noncomputable degrees
From MaRDI portal
Publication:4736749
DOI10.1002/MALQ.200310092zbMath1054.03030OpenAlexW2074244968MaRDI QIDQ4736749
Publication date: 6 August 2004
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200310092
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
This page was built for publication: Lattice embeddings and array noncomputable degrees