Badaev, S. A.Mustafa, M.Sorbi, Andrea2015-12-252015-12-252014Badaev S. A., Mustafa M., Sorbi Andrea; 2014; Friedberg numberings in the Ershov hierarchyhttp://nur.nu.edu.kz/handle/123456789/970We show that for every n 1, there exists a 􀀀1n -computable family which up to equivalence has exactly one Friedberg numbering which does not induce the least element of the corresponding Rogers semilattice.enResearch Subject Categories::MATHEMATICSminimal numberingsArticle