Computable Stone spaces
From MaRDI portal
Publication:6109093
DOI10.1016/j.apal.2023.103304arXiv2107.01536OpenAlexW3180976055MaRDI QIDQ6109093
Matthew Harrison-Trainor, Alexander G. Melnikov, Nikolay Bazhenov
Publication date: 26 July 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.01536
Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)
Related Items
Separating notions in effective topology ⋮ On the main scientific achievements of Victor Selivanov ⋮ COMPUTABLY COMPACT METRIC SPACES
Cites Work
- Closed choice and a uniform low basis theorem
- Some constructivizations of Abelian groups
- Arithmetic hierarchy and ideals of enumerated Boolean algebras
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Autostability of models
- Computable structures and the hyperarithmetical hierarchy
- Computable topological abelian groups
- Computable analysis and classification problems
- Computable Boolean algebras
- Computable structures and operations on the space of continuous functions
- Recursive isomorphism types of recursive Boolean algebras
- Plottable Real Number Functions and the Computable Graph Theorem
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- COMPUTABLE POLISH GROUP ACTIONS
- Computable copies of ℓ p 1
- Analytic computable structure theory and $L^p$ spaces
- Computable topological groups and Pontryagin duality
- Computability of Subsets of Metric Spaces
- Foundations for Computable Topology
- Computably Isometric Spaces
- Hierarchies of Boolean algebras
- On the topological aspects of the theory of represented spaces
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- COMPUTABLY COMPACT METRIC SPACES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
