Degrees of unsolvability and strong forms of \(\Lambda_R+\Lambda_R\underset\neq\supset\Lambda_R\)

DOI10.1305/NDJFL/1093888120zbMath0383.03031OpenAlexW2073471073MaRDI QIDQ1248620

Thomas G. McLaughlin

Publication date: 1977

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093888120

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Recursive equivalence types of sets and structures, isols (03D50)

Related Items (1)

Ideals in isols containing a set of regressive isols

This page was built for publication: Degrees of unsolvability and strong forms of \(\Lambda_R+\Lambda_R\underset\neq\supset\Lambda_R\)