Supersimple sets and the problem of extending a retracing function

DOI10.2140/PJM.1972.41.485zbMath0255.02043OpenAlexW2139309745MaRDI QIDQ2558217

Thomas G. McLaughlin

Publication date: 1972

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1972.41.485

Mathematics Subject Classification ID

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

Related Items (2)

Computable categoricity and the Ershov hierarchy ⋮ Reducibility of partial recursive functions

This page was built for publication: Supersimple sets and the problem of extending a retracing function