Standard

A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains. / Morozov, A. S.

в: Siberian Mathematical Journal, Том 59, № 3, 01.05.2018, стр. 463-469.

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

Harvard

Morozov, AS 2018, 'A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains', Siberian Mathematical Journal, Том. 59, № 3, стр. 463-469. https://doi.org/10.1134/S0037446618030096

APA

Morozov, A. S. (2018). A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains. Siberian Mathematical Journal, 59(3), 463-469. https://doi.org/10.1134/S0037446618030096

Vancouver

Morozov AS. A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains. Siberian Mathematical Journal. 2018 май 1;59(3):463-469. doi: 10.1134/S0037446618030096

Author

Morozov, A. S. / A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains. в: Siberian Mathematical Journal. 2018 ; Том 59, № 3. стр. 463-469.

BibTeX

@article{de515e3ab9944ea7ac41a748e6825925,
title = "A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains",
abstract = "We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.",
keywords = "antichain, chain, computable order, computably enumerable order",
author = "Morozov, {A. S.}",
year = "2018",
month = may,
day = "1",
doi = "10.1134/S0037446618030096",
language = "English",
volume = "59",
pages = "463--469",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "MAIK NAUKA/INTERPERIODICA/SPRINGER",
number = "3",

}

RIS

TY - JOUR

T1 - A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains

AU - Morozov, A. S.

PY - 2018/5/1

Y1 - 2018/5/1

N2 - We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.

AB - We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.

KW - antichain

KW - chain

KW - computable order

KW - computably enumerable order

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

U2 - 10.1134/S0037446618030096

DO - 10.1134/S0037446618030096

M3 - Article

AN - SCOPUS:85049305934

VL - 59

SP - 463

EP - 469

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

SN - 0037-4466

IS - 3

ER -

ID: 14317996