Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings. / Ospichev, S. S.
In: Journal of Mathematical Sciences (United States), Vol. 215, No. 4, 01.06.2016, p. 529-536.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
AU - Ospichev, S. S.
PY - 2016/6/1
Y1 - 2016/6/1
N2 - We construct an example of a computable family of sets that does not possess ∑a−1 -computable principal numberings for any a ϵ [InlineMediaObject not available: see fulltext.]. Bibliography: 19 titles.
AB - We construct an example of a computable family of sets that does not possess ∑a−1 -computable principal numberings for any a ϵ [InlineMediaObject not available: see fulltext.]. Bibliography: 19 titles.
UR - http://www.scopus.com/inward/record.url?scp=84978696590&partnerID=8YFLogxK
U2 - 10.1007/s10958-016-2857-3
DO - 10.1007/s10958-016-2857-3
M3 - Article
AN - SCOPUS:84978696590
VL - 215
SP - 529
EP - 536
JO - Journal of Mathematical Sciences (United States)
JF - Journal of Mathematical Sciences (United States)
SN - 1072-3374
IS - 4
ER -
ID: 19999244