DROPS

Document

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)

Authors: Mathieu Hoyrup, Arno Pauly, Victor Selivanov, and Mariya I. Soskova

Published in: Dagstuhl Reports, Volume 11, Issue 10 (2022)

Abstract

Computability and continuity are closely linked - in fact, continuity can be seen as computability relative to an arbitrary oracle. As such, concepts from topology and descriptive set theory feature heavily in the foundations of computable analysis. Conversely, techniques developed in computability theory can be fruitfully employed in topology and descriptive set theory, even if the desired results mention no computability at all. In this Dagstuhl Seminar, we brought together researchers from computable analysis, from classical computability theory, from descriptive set theory, formal topology, and other relevant areas. Our goals were to identify key open questions related to this interplay, to exploit synergies between the areas and to intensify collaboration between the relevant communities.

Cite as

Mathieu Hoyrup, Arno Pauly, Victor Selivanov, and Mariya I. Soskova. Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). In Dagstuhl Reports, Volume 11, Issue 10, pp. 72-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@Article{hoyrup_et_al:DagRep.11.10.72,
  author =	{Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.},
  title =	{{Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)}},
  pages =	{72--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{10},
  editor =	{Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.10.72},
  URN =		{urn:nbn:de:0030-drops-159293},
  doi =		{10.4230/DagRep.11.10.72},
  annote =	{Keywords: computable analysis, enumeration degrees, quasi-polish spaces, synthetic topology}
}

Search Results

Documents authored by Soskova, Mariya I.

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)

Abstract

Cite as

Thanks for your feedback!

Could not send message