Author:
Bazhenov Nikolay,Harrison-Trainor Matthew,Melnikov Alexander
Reference35 articles.
1. Computable Structures and the Hyperarithmetical Hierarchy;Ash,2000
2. Closed choice and a uniform low basis theorem;Brattka;Ann. Pure Appl. Log.,2012
3. On the complexity of classifying Lebesgue spaces;Brown;J. Symb. Log.,2020
4. Plottable real number functions and the computable graph theorem;Brattka;SIAM J. Comput.,2008
5. Computable Structure Theory on Banach Spaces;Brown,2019
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computably and punctually universal spaces;Annals of Pure and Applied Logic;2025-01
2. Every Δ⁰₂ Polish space is computable topological;Proceedings of the American Mathematical Society;2024-05-07
3. On the main scientific achievements of Victor Selivanov;Computability;2023-12-21
4. Separating notions in effective topology;International Journal of Algebra and Computation;2023-10-31
5. COMPUTABLE TOPOLOGICAL GROUPS;The Journal of Symbolic Logic;2023-09-18