COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

DOI10.1017/jsl.2020.67zbMath1473.03025OpenAlexW3096756779MaRDI QIDQ5858927

Alexander G. Melnikov, Matthew Harrison-Trainor, Keng Meng Ng

Publication date: 15 April 2021

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

Full work available at URL: https://doi.org/10.1017/jsl.2020.67

zbMATH Keywords

Stone dualityhomomorphismPolish spacePolish groupcomputable analysiscomputable ordinalapplications of computable structure theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items (9)

New degree spectra of Polish spaces ⋮ On the complexity of the theory of a computably presented metric structure ⋮ Computable Stone spaces ⋮ Separating notions in effective topology ⋮ On the main scientific achievements of Victor Selivanov ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computable topological abelian groups ⋮ Enumerating classes of effective quasi-Polish spaces ⋮ Degrees of non-computability of homeomorphism types of Polish spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some constructivizations of Abelian groups
• Algebraic extensions of finite corank of Hilbertian fields
• Index sets in computable analysis
• Effective properties of sets and functions in metric spaces with computability structure
• Computable structures and the hyperarithmetical hierarchy
• Computable analysis and classification problems
• Computability on quasi-Polish spaces
• On degree spectra of topological spaces
• Countable retracing functions and \(\Pi_2^0\) predicates
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• Computable Boolean algebras
• COMPUTABLE ABELIAN GROUPS
• Computable structures and operations on the space of continuous functions
• Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Computability and Noncomputability in Classical Analysis
• Effective aspects of profinite groups
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Effective Galois theory
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• COMPUTABLE POLISH GROUP ACTIONS
• UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
• Computable copies of ℓ p 1
• Analytic computable structure theory and $L^p$ spaces
• Computable topological groups and Pontryagin duality
• Effectively closed subgroups of the infinite symmetric group
• On Computable Metrization
• The isometry degree of a computable copy of ℓ p 1
• The Classification Problem for Compact Computable Metric Spaces
• Computably Isometric Spaces
• Ranked structures and arithmetic transfinite recursion
• Hierarchies of Boolean algebras
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM