Friedberg numberings in the Ershov hierarchy

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.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.identifier.citation	Badaev, S. A., Manat, M., & Sorbi, A. (2015). Friedberg numberings in the Ershov hierarchy. Archive for Mathematical Logic, 54(1), 59-73.
dc.identifier.doi	10.1007/s00153-014-0402-y
dc.identifier.uri	http://nur.nu.edu.kz/handle/123456789/970
dc.language.iso	en
dc.publisher	Springer
dc.source	Archive for Mathematical Logic, 54(1), 59-73.
dc.subject	minimal numberings
dc.title	Friedberg numberings in the Ershov hierarchy
dc.type	Article

Files

Now showing 1 - 1 of 1