Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

S. S. Ospichev

doi:10.1007/s10958-016-2857-3

Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

S. S. Ospichev

Кафедра дискретной математики и информатики ММФ и СУНЦ

Результат исследования: Научные публикации в периодических изданиях › статья › рецензирование

2 Цитирования (Scopus)

Аннотация

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.

Язык оригинала	английский
Страницы (с-по)	529-536
Число страниц	8
Журнал	Journal of Mathematical Sciences (United States)
Том	215
Номер выпуска	4
DOI	https://doi.org/10.1007/s10958-016-2857-3
Состояние	Опубликовано - 1 июн 2016

Доступ к документу

10.1007/s10958-016-2857-3

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@article{bea469cfdc114d62ad43e9cff0a399ca,

title = "Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings",

abstract = "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.",

author = "Ospichev, {S. S.}",

year = "2016",

month = jun,

day = "1",

doi = "10.1007/s10958-016-2857-3",

language = "English",

volume = "215",

pages = "529--536",

journal = "Journal of Mathematical Sciences (United States)",

issn = "1072-3374",

publisher = "Springer Nature",

number = "4",

}

Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings. / Ospichev, S. S.

В: Journal of Mathematical Sciences (United States), Том 215, № 4, 01.06.2016, стр. 529-536.

Результат исследования: Научные публикации в периодических изданиях › статья › рецензирование

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 -