Система будет остановлена для регулярного обслуживания. Пожалуйста, сохраните рабочие данные и выйдите из системы.
dc.contributor.author | Badaev, S. A. | |
dc.contributor.author | Mustafa, M. | |
dc.contributor.author | Sorbi, Andrea | |
dc.date.accessioned | 2015-12-25T04:57:24Z | |
dc.date.available | 2015-12-25T04:57:24Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | Badaev S. A., Mustafa M., Sorbi Andrea; 2014; Friedberg numberings in the Ershov hierarchy | ru_RU |
dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/970 | |
dc.description.abstract | We 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. | ru_RU |
dc.language.iso | en | ru_RU |
dc.subject | Research Subject Categories::MATHEMATICS | ru_RU |
dc.subject | minimal numberings | ru_RU |
dc.title | Friedberg numberings in the Ershov hierarchy | ru_RU |
dc.type | Article | ru_RU |