Computably Isometric Spaces

From MaRDI portal
Publication:5407041

DOI10.2178/jsl.7804030zbMath1332.03008OpenAlexW2068855023MaRDI QIDQ5407041

Alexander G. Melnikov

Publication date: 4 April 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1388953994




Related Items (29)

A semilattice of degrees of computable metricsNew degree spectra of Polish spacesMAXIMAL COMPUTABILITY STRUCTURESA Note on the Computable Categoricity of $$\ell ^p$$ ℓ p SpacesComputable reducibility of metrics on the realsUNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURESOn the complexity of the theory of a computably presented metric structureGeneralized effective completeness for continuous logicComputable Stone spacesDescriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spacesCOMPUTABLY COMPACT METRIC SPACESReducibility of computable metrics on the real lineAnalytic computable structure theory and $L^p$ spacesDegrees of and lowness for isometric isomorphismComputing the exponent of a Lebesgue spaceComputable topological groups and Pontryagin dualityComputable metrics above the standard real metricEffectively closed subgroups of the infinite symmetric groupComputable structures and operations on the space of continuous functionsDense computability structuresOracle computability of conditional expectations onto subfactorsAnalytic computable structure theory and \(L^p\)-spaces. IION THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACESCOMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISMEnumerating classes of effective quasi-Polish spacesEffective compactness and orbits of points under the isometry groupComputable analysis and classification problemsDegrees of non-computability of homeomorphism types of Polish spacesComputability of Subsets of Metric Spaces






This page was built for publication: Computably Isometric Spaces