A comparison of concepts from computable analysis and effective descriptive set theory

Autor:	Gregoriades, Vassilios, Kispéter, Tamás, Pauly, Arno
Rok vydání:	2014
Předmět:	Computer Science - Logic in Computer Science Mathematics - General Topology 03E15 03D78 F.2
Druh dokumentu:	Working Paper
DOI:	10.1017/S0960129516000128
Popis:	Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail. Comment: accepted for publication in the special issue of "Mathematical Structures in Computer Science" dedicated to CCC 2013
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1403.7997 Zobrazit plný text záznamu View this record from Arxiv