COMPUTABLY COMPACT METRIC SPACES
From MaRDI portal
Publication:6170503
DOI10.1017/bsl.2023.16MaRDI QIDQ6170503
Rodney G. Downey, Alexander G. Melnikov
Publication date: 10 August 2023
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)
Related Items
Strong computable type ⋮ Computable Stone spaces ⋮ Separating notions in effective topology ⋮ On the main scientific achievements of Victor Selivanov
Cites Work
- Overt choice
- Degrees of and lowness for isometric isomorphism
- A proof of completeness for continuous first-order logic
- Taking the path computably traveled
- Connected choice and the Brouwer fixed point theorem
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Measures and their random reals
- Computability of compact operators on computable Banach spaces with bases
- The Classification Problem for Compact Computable Metric Spaces
- First Order Theories of Some Lattices of Open Sets
- Computably Isometric Spaces
- Some properties of constructive real numbers and constructive functions
- A minimal pair of Π10 classes
- Recursive metric spaces
- Hierarchies of Boolean algebras
- ∏ 0 1 Classes and Degrees of Theories
- On the topological aspects of the theory of represented spaces
- Sur un espace métrique séparable universel
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- Computing Haar Measures
- Primitive recursive ordered fields and some applications
- The structure of compact groups. A primer for the student -- a handbook for the expert
- Representations versus numberings: On the relationship of two computability notions
- Computable Stone spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closed choice and a uniform low basis theorem
- Hierarchies of torsion-free Abelian groups
- Computing space-filling curves
- Enumerations and completely decomposable torsion-free abelian groups
- New degree spectra of Polish spaces
- Primitive recursive ordered fields and some applications
- Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
- Arithmetic hierarchy and ideals of enumerated Boolean algebras
- Borel complexity and computability of the Hahn-Banach theorem
- Computability of Julia sets
- \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination
- How incomputable is the separable Hahn-Banach theorem?
- Effective topological spaces. I: A definability theory
- Effective topological spaces. II: A hierarchy
- Effective topological spaces. III: Forcing and definability
- Computational complexity of real functions
- Space-filling curves
- Computability on subsets of metric spaces.
- Computable structures and the hyperarithmetical hierarchy
- Enumeration degrees and topology
- Semicomputable manifolds in computable topological spaces
- Computability of products of chainable continua
- On the computability of the set of automorphisms of the unit square
- Computable topological abelian groups
- Effective compactness and orbits of points under the isometry group
- Computable analysis and classification problems
- Degrees of non-computability of homeomorphism types of Polish spaces
- Universality for left-computably enumerable metric spaces
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Recursive analysis
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- A counterexample to the approximation problem in Banach spaces
- Uniform test of algorithmic randomness over a general space
- Computable Boolean algebras
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
- Turing's Legacy
- Computable structures and operations on the space of continuous functions
- Randomness for non-computable measures
- Compact manifolds with computable boundaries
- Compactness and the Effectivity of Uniformization
- Algorithmic Randomness and Complexity
- Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete
- Computable functionals
- On the definition of computable functionals
- On the definitions of computable real continuous functions
- The Role of Compactness in Analysis
- Degrees of models
- REVERSE MATHEMATICS OF MF SPACES
- On Turing degrees of points in computable topology
- Plottable Real Number Functions and the Computable Graph Theorem
- Computability and Noncomputability in Classical Analysis
- Effective aspects of profinite groups
- Effective Galois theory
- Effective content of field theory
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Recursively enumerable vector spaces
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- COMPUTABLE POLISH GROUP ACTIONS
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
- A comparison of concepts from computable analysis and effective descriptive set theory
- On Computable Field Embeddings and Difference Closed Fields
- The Rice-Shapiro theorem in Computable Topology
- Computable topological groups and Pontryagin duality
- Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
- Shorter Notes: Profinite Groups are Galois Groups
- Computational complexity on computable metric spaces
- Towards Computability over Effectively Enumerable Topological Spaces
- Computability of 1-manifolds
- Highlights of the Rice-Shapiro Theorem in Computable Topology
- Computability of Subsets of Metric Spaces
- Effective aspects of Hausdorff and Fourier dimension
- Cousin’s lemma in second-order arithmetic
