Standard

Well-Quasi Orders and Hierarchy Theory. / Selivanov, Victor.

Well-Quasi Orders in Computation, Logic, Language and Reasoning. Том 53 2020. стр. 271-319 (Trends in Logic; Том 53).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › Рецензирование

Harvard

Selivanov, V 2020, Well-Quasi Orders and Hierarchy Theory. в Well-Quasi Orders in Computation, Logic, Language and Reasoning. Том. 53, Trends in Logic, Том. 53, стр. 271-319. https://doi.org/10.1007/978-3-030-30229-0_10

APA

Selivanov, V. (2020). Well-Quasi Orders and Hierarchy Theory. в Well-Quasi Orders in Computation, Logic, Language and Reasoning (Том 53, стр. 271-319). (Trends in Logic; Том 53). https://doi.org/10.1007/978-3-030-30229-0_10

Vancouver

Selivanov V. Well-Quasi Orders and Hierarchy Theory. в Well-Quasi Orders in Computation, Logic, Language and Reasoning. Том 53. 2020. стр. 271-319. (Trends in Logic). https://doi.org/10.1007/978-3-030-30229-0_10

Author

Selivanov, Victor. / Well-Quasi Orders and Hierarchy Theory. Well-Quasi Orders in Computation, Logic, Language and Reasoning. Том 53 2020. стр. 271-319 (Trends in Logic).

BibTeX

@inbook{06d0cb5d7bad48018d354ba2c53c2458,
title = "Well-Quasi Orders and Hierarchy Theory",
abstract = "We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies of sets usually degenerate to structures very close to ordinals, the extension of them to functions requires more complicated WQOs, and the same applies to reducibilities. We survey some results obtained so far and discuss open problems and possible research directions.",
keywords = "Better quasiorder, Borel hierarchy, Fine hierarchy, h-Quasiorder, Hausdorff hierarchy, k-Partition, Labeled tree, Quasi-polish space, Reducibility, Wadge hierarchy, Well quasiorder",
author = "Victor Selivanov",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-30229-0_10",
language = "English",
volume = "53",
series = "Trends in Logic",
pages = "271--319",
booktitle = "Well-Quasi Orders in Computation, Logic, Language and Reasoning",

}

RIS

TY - CHAP

T1 - Well-Quasi Orders and Hierarchy Theory

AU - Selivanov, Victor

PY - 2020/1/1

Y1 - 2020/1/1

N2 - We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies of sets usually degenerate to structures very close to ordinals, the extension of them to functions requires more complicated WQOs, and the same applies to reducibilities. We survey some results obtained so far and discuss open problems and possible research directions.

AB - We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies of sets usually degenerate to structures very close to ordinals, the extension of them to functions requires more complicated WQOs, and the same applies to reducibilities. We survey some results obtained so far and discuss open problems and possible research directions.

KW - Better quasiorder

KW - Borel hierarchy

KW - Fine hierarchy

KW - h-Quasiorder

KW - Hausdorff hierarchy

KW - k-Partition

KW - Labeled tree

KW - Quasi-polish space

KW - Reducibility

KW - Wadge hierarchy

KW - Well quasiorder

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

U2 - 10.1007/978-3-030-30229-0_10

DO - 10.1007/978-3-030-30229-0_10

M3 - Chapter

AN - SCOPUS:85093854551

VL - 53

T3 - Trends in Logic

SP - 271

EP - 319

BT - Well-Quasi Orders in Computation, Logic, Language and Reasoning

ER -

ID: 126991333