Borel Complexity of Topological Operations on Computable Metric Spaces

DOI10.1093/logcom/exn027zbMath1169.03047OpenAlexW4245716479MaRDI QIDQ3611721

Guido Gherardi, Vasco Brattka

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/79a1a3a27e55d53342cce620349c4afc36eab98d

zbMATH Keywords

Borel hierarchyFell topologytheory of representationscomputable analysiseffective descriptive set theoryEffros Borel structureeffective Borel complexityeffective Borel measurability

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Theory of numerations, effectively presented structures (03D45)

Related Items (16)

On the uniform computational content of the Baire category theorem ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ On images of partial computable functions over computable Polish spaces ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory ⋮ Closed choice and a uniform low basis theorem ⋮ Completion of choice ⋮ On the topological aspects of the theory of represented spaces ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ $K$-triviality in computable metric spaces ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computable analysis and classification problems ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Borel Complexity of Topological Operations on Computable Metric Spaces