The least Σ-jump inversion theorem for N-families

Marat Faizrahmanov; Iskander Kalimullin; Antonio Montalbán; Vadim Puzarenko

The least Σ-jump inversion theorem for N-families

Marat Faizrahmanov, Iskander Kalimullin, Antonio Montalbán, Vadim Puzarenko

Кафедра математических наук ММФ и СУНЦ НГУ

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

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

Аннотация

Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥_T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent to X ⊕ X. This fact will be generalized for the class of n-families (families of families of… of sets).

Язык оригинала	английский
Страницы (с-по)	529-538
Число страниц	10
Журнал	Journal of Universal Computer Science
Том	23
Номер выпуска	6
Состояние	Опубликовано - 1 янв. 2017

Другие файлы и ссылки

Link to publication in Scopus

Цитировать

@article{b88b0158c200400b90b6f8850c5015c3,

title = "The least Σ-jump inversion theorem for N-families",

abstract = "Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent to X ⊕ X. This fact will be generalized for the class of n-families (families of families of… of sets).",

keywords = "Countable family, Enumeration jump, Jump of structure, N-family, Σ-jump, Σ-reducibility",

author = "Marat Faizrahmanov and Iskander Kalimullin and Antonio Montalb{\'a}n and Vadim Puzarenko",

note = "Publisher Copyright: {\textcopyright} J.UCS.",

year = "2017",

month = jan,

day = "1",

language = "English",

volume = "23",

pages = "529--538",

journal = "Journal of Universal Computer Science",

issn = "0948-695X",

publisher = "GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM",

number = "6",

}

The least Σ-jump inversion theorem for N-families. / Faizrahmanov, Marat; Kalimullin, Iskander; Montalbán, Antonio и др.

В: Journal of Universal Computer Science, Том 23, № 6, 01.01.2017, стр. 529-538.

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

TY - JOUR

T1 - The least Σ-jump inversion theorem for N-families

AU - Faizrahmanov, Marat

AU - Kalimullin, Iskander

AU - Montalbán, Antonio

AU - Puzarenko, Vadim

N1 - Publisher Copyright: © J.UCS.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent to X ⊕ X. This fact will be generalized for the class of n-families (families of families of… of sets).

AB - Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent to X ⊕ X. This fact will be generalized for the class of n-families (families of families of… of sets).

KW - Countable family

KW - Enumeration jump

KW - Jump of structure

KW - N-family

KW - Σ-jump

KW - Σ-reducibility

UR - http://www.scopus.com/inward/record.url?scp=85029430937&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85029430937

VL - 23

SP - 529

EP - 538

JO - Journal of Universal Computer Science

JF - Journal of Universal Computer Science

SN - 0948-695X

IS - 6

ER -

The least Σ-jump inversion theorem for N-families

Аннотация

Другие файлы и ссылки

Fingerprint

Цитировать