DSpace Repository
Friedberg numberings in the Ershov hierarchy
Home
About NUR
Policy
FAQ
Login
Eng
Рус
Қаз
NUR Home
→
01.NU Schools
→
School of Science and Technology (2015-2019)
→
Mathematics
→
Articles
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Search DSpace
This Collection
Advanced Search
Friedberg numberings in the Ershov hierarchy
Badaev, S. A.
;
Mustafa, M.
;
Sorbi, Andrea
URI:
http://nur.nu.edu.kz/handle/123456789/970
Date:
2014
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.
Show full item record
View publisher version
Access full-text PDF
Open Access
View publisher version
Check access options
View/
Open
Files in this item
Name:
Friedberg numberings ...
Size:
350.4Kb
Format:
PDF
View/
Open
This item appears in the following Collection(s)
Articles
[85]
Video Guide
Submission guide
Submit your materials for publication to
NU Repository Drive
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
Type
This Collection
By Issue Date
Authors
Titles
Subjects
Type
My Account
Login
Statistics
View Usage Statistics
Indexed in
Google Scholar
OpenDOAR
ROAR