Standard

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

In: Journal of Universal Computer Science, Vol. 23, No. 6, 01.01.2017, p. 529-538.

Research output: Contribution to journal › Article › peer-review

Harvard

Faizrahmanov, M, Kalimullin, I, Montalbán, A & Puzarenko, V 2017, 'The least Σ-jump inversion theorem for N-families', Journal of Universal Computer Science, vol. 23, no. 6, pp. 529-538.

APA

Faizrahmanov, M., Kalimullin, I., Montalbán, A., & Puzarenko, V. (2017). The least Σ-jump inversion theorem for N-families. Journal of Universal Computer Science, 23(6), 529-538.

Vancouver

Faizrahmanov M, Kalimullin I, Montalbán A, Puzarenko V. The least Σ-jump inversion theorem for N-families. Journal of Universal Computer Science. 2017 Jan 1;23(6):529-538.

Author

Faizrahmanov, Marat ; Kalimullin, Iskander ; Montalbán, Antonio et al. / The least Σ-jump inversion theorem for N-families. In: Journal of Universal Computer Science. 2017 ; Vol. 23, No. 6. pp. 529-538.

BibTeX

@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",

}

RIS

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 -

ID: 12693281