Computable structures and operations on the space of continuous functions

DOI10.4064/fm36-12-2015zbMath1393.03025MaRDI QIDQ2804293

Keng Meng Ng, Alexander G. 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

zbMATH Keywords

continuous functions; effective categoricity; effective Banach space

Mathematics Subject Classification ID

03D80: Applications of computability and recursion theory

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES, Analytic computable structure theory and $L^p$ spaces, Computable topological groups and Pontryagin duality, Computing the exponent of a Lebesgue space, ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, Computable Stone spaces, COMPUTABLY COMPACT METRIC SPACES, A semilattice of degrees of computable metrics, A note on computable distinguishing colorings, Oracle computability of conditional expectations onto subfactors, Computable analysis and classification problems, A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces

Cites Work

• Towards computability of elliptic boundary value problems in variational formulation
• Autostability of models and Abelian groups
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Ranks of differentiable functions
• The Set of Continuous Functions with the Everywhere Convergent Fourier Series
• Recursively Categorical Linear Orderings
• A Real Number Structure that is Effectively Categorical
• On the Denjoy rank, the Kechris-Woodin rank and the Zalcwasser rank
• The Kechris-Woodin Rank is Finer Than the Zalcwasser Rank
• Computably Isometric Spaces
• Computable Algebra, General Theory and Theory of Computable Fields
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item