Extending properly n - REA sets1
From MaRDI portal
Publication:5061390
DOI10.3233/COM-210362MaRDI QIDQ5061390
Peter A. Cholak, Peter M. Gerdes
Publication date: 12 January 2023
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.01299
recursively enumerable; computability theory; recursion theory; Turing degree; REA sets; recursively enumerable and above
03Dxx: Computability and recursion theory