License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.11.10.72
URN: urn:nbn:de:0030-drops-159293
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15929/
Go back to Dagstuhl Reports

Hoyrup, Mathieu ; Pauly, Arno ; Selivanov, Victor ; Soskova, Mariya I.
Weitere Beteiligte (Hrsg. etc.): Mathieu Hoyrup and Arno Pauly and Victor Selivanov and Mariya I. Soskova

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)

pdf-format:
dagrep_v011_i010_p072_21461.pdf (3 MB)

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.

BibTeX - Entry

@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/opus/volltexte/2022/15929},
  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}
}

Keywords: computable analysis, enumeration degrees, quasi-polish spaces, synthetic topology
Collection: DagRep, Volume 11, Issue 10
Issue Date: 2022
Date of publication: 11.04.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI