arXiv Analytics

Sign in

arXiv:1703.05470 [math.LO]AbstractReferencesReviewsResources

Coding Polish spaces

Diego Alejandro Mejía

Published 2017-03-16Version 1

We use countable metric spaces to code Polish metric spaces and evaluate the complexity of some statements about these codes and of some relations that can be determined by the codes. Also, we propose a coding for continuous functions between Polish metric spaces.

Comments: 9 pages, RIMS Set Theory Workshop: Mathematical Logic and Its Applications . September 26-29, 2016, Kyoto University, Japan. To appear in Kyoto Daigaku Suurikaiseki Kenkyuusho Koukyuuroku
Categories: math.LO
Subjects: 54H05, 28A05, 03E15
Related articles: Most relevant | Search more
arXiv:2410.00901 [math.LO] (Published 2024-10-01)
The Complexity of Proper Homotopy Equivalence of Graphs
arXiv:1003.5983 [math.LO] (Published 2010-03-31)
Complexity of Ramsey null sets
arXiv:1510.08969 [math.LO] (Published 2015-10-30)
The complexity of the classification problem of continua

Links

Toolbox