The Least Sigma-jump Inversion Theorem for n-families

Marat Faizrahmanov; Iskander Kalimullin; Antonio Montalban; Vadim Puzarenko

The Least Sigma-jump Inversion Theorem for n-families

Marat Faizrahmanov, Iskander Kalimullin, Antonio Montalban, Vadim Puzarenko

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

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

Аннотация

Studying the Sigma-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X >=(T) empty set' there is a family of sets F which is the Sigma-least countable family whose Sigma-jump is Sigma-equivalent to X circle plus (X) over bar. 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
Состояние	Опубликовано - 2017

Цитировать

@article{ae4229c3ea9141de86773a989be08fd1,

title = "The Least Sigma-jump Inversion Theorem for n-families",

abstract = "Studying the Sigma-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X >=(T) empty set' there is a family of sets F which is the Sigma-least countable family whose Sigma-jump is Sigma-equivalent to X circle plus (X) over bar. This fact will be generalized for the class of n-families (families of families of ... of sets).",

keywords = "jump of structure, enumeration jump, Sigma-jump, Sigma-reducibility, countable family, n-family, ENUMERATION SPECTRUM HIERARCHY",

author = "Marat Faizrahmanov and Iskander Kalimullin and Antonio Montalban and Vadim Puzarenko",

year = "2017",

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 Sigma-jump Inversion Theorem for n-families. / Faizrahmanov, Marat; Kalimullin, Iskander; Montalban, Antonio и др.

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

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

TY - JOUR

T1 - The Least Sigma-jump Inversion Theorem for n-families

AU - Faizrahmanov, Marat

AU - Kalimullin, Iskander

AU - Montalban, Antonio

AU - Puzarenko, Vadim

PY - 2017

Y1 - 2017

N2 - Studying the Sigma-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X >=(T) empty set' there is a family of sets F which is the Sigma-least countable family whose Sigma-jump is Sigma-equivalent to X circle plus (X) over bar. This fact will be generalized for the class of n-families (families of families of ... of sets).

AB - Studying the Sigma-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X >=(T) empty set' there is a family of sets F which is the Sigma-least countable family whose Sigma-jump is Sigma-equivalent to X circle plus (X) over bar. This fact will be generalized for the class of n-families (families of families of ... of sets).

KW - jump of structure

KW - enumeration jump

KW - Sigma-jump

KW - Sigma-reducibility

KW - countable family

KW - n-family

KW - ENUMERATION SPECTRUM HIERARCHY

M3 - Article

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 Sigma-jump Inversion Theorem for n-families

Аннотация

Fingerprint

Цитировать