Computability on Quasi-Polish Spaces

Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M. Stull

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits several characterizations. We show that some natural effectivizations of quasi-metric spaces are strictly stronger.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings
EditorsMichal Hospodár, Galina Jirásková, Stavros Konstantinidis
PublisherSpringer Verlag
Pages171-183
Number of pages13
ISBN (Print)9783030232467
DOIs
Publication statusPublished - 1 Jan 2019
Event21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Slovakia
Duration: 17 Jul 201919 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11612 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019
Country/TerritorySlovakia
CityKošice
Period17/07/1919/07/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Computability on Quasi-Polish Spaces'. Together they form a unique fingerprint.

Cite this