Система будет остановлена для регулярного обслуживания. Пожалуйста, сохраните рабочие данные и выйдите из системы.

Browsing School of Science and Technology (2015-2019) by Subject "minimal numberings"

Now showing items 1-1 of 1

Friedberg numberings in the Ershov hierarchy

Badaev, S. A.; Mustafa, M.; Sorbi, Andrea (2014)

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.