Computable structures and operations on the space of continuous functions
DOI10.4064/FM36-12-2015zbMATH Open1393.03025OpenAlexW2549647330MaRDI QIDQ2804293FDOQ2804293
Keng Meng Ng, Alexander Melnikov
Publication date: 28 April 2016
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3d438db3290b8e9a79d2c09eb221879c33aa6e1e
Recommendations
- Computability and continuity in metric partial algebras equipped with computability structures
- scientific article; zbMATH DE number 1088270
- scientific article; zbMATH DE number 1344955
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Effective properties of sets and functions in metric spaces with computability structure
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Autostability of models and Abelian groups
- Computable structures and the hyperarithmetical hierarchy
- Title not available (Why is that?)
- Recursively Categorical Linear Orderings
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Computable Algebra, General Theory and Theory of Computable Fields
- A lightface analysis of the differentiability rank
- Towards computability of elliptic boundary value problems in variational formulation
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- Title not available (Why is that?)
- Ranks of differentiable functions
- A Real Number Structure that is Effectively Categorical
- Computably Isometric Spaces
- The Set of Continuous Functions with the Everywhere Convergent Fourier Series
- On the Denjoy rank, the Kechris-Woodin rank and the Zalcwasser rank
- The Kechris-Woodin Rank is Finer Than the Zalcwasser Rank
Cited In (18)
- A semilattice of degrees of computable metrics
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Computable topological groups and Pontryagin duality
- Computable analysis and classification problems
- COMPUTABLY COMPACT METRIC SPACES
- A note on computable distinguishing colorings
- Interval-valued computations and their connection with PSPACE
- Computably and punctually universal spaces
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
- Oracle computability of conditional expectations onto subfactors
- Computable presentations of C*-algebras
- Computing the exponent of a Lebesgue space
- Analytic computable structure theory and $L^p$ spaces
- Computable Stone spaces
- On Computational Constructions in Function Spaces
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
This page was built for publication: Computable structures and operations on the space of continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804293)
