Temat: infinite games - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: The use of complexity hierarchies in descriptive set theory and automata theory
Autorzy:: Andretta, A.
Camerlo, R.
Powiązania:: https://bibliotekanauki.pl/articles/1964199.pdf
Data publikacji:: 2005
Wydawca:: Politechnika Gdańska
Tematy:: hierarchies
infinite games
Borel reducibility
automata theory
Opis:: The concept of a reduction between subsets of a given space is described, giving rise to various complexity hierarchies, studied both in descriptive set theory and in automata theory. We discuss in particular the Wadge and Lipschitz hierarchies for subsets of the Baire and Cantor spaces and the hierarchy of Borel reducibility for finitary relations on standard Borel spaces. The notions of Wadge and Lipschitz reductions are related to corresponding perfect information games.
Źródło:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2005, 9, 3; 337-356
1428-6394
Pojawia się w:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Combinatorics of open covers (III): games, Cp (X)
Autorzy:: Scheepers, Marion
Powiązania:: https://bibliotekanauki.pl/articles/1205443.pdf
Data publikacji:: 1997
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: Rothberger property
Menger property
ω-cover
$S_1(Ω, Ω)$
$S_{fin}(Ω, Ω)$
$C_p(X)$
countable fan tightness
countable strong fan tightness
infinite games
Opis:: Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces $C_p(X)$ of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.
Źródło:: Fundamenta Mathematicae; 1997, 152, 3; 231-254
0016-2736
Pojawia się w:: Fundamenta Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja