107 citations to https://www.mathnet.ru/rus/al201
  1. Matthew de Brecht, Takayuki Kihara, Victor Selivanov, “Ideal presentations and numberings of some classes of effective quasi-Polish spaces”, COM, 2024, 1  crossref
  2. Matthew Harrison-Trainor, Alexander Melnikov, “An arithmetic analysis of closed surfaces”, Trans. Amer. Math. Soc., 2024  crossref
  3. Nikolay Bazhenov, Alexander Melnikov, Keng Meng Ng, “Every Δ⁰₂ Polish space is computable topological”, Proc. Amer. Math. Soc., 2024  crossref
  4. Ekaterina B. Fokina, Sebastiaan A. Terwijn, Lecture Notes in Computer Science, 14773, Twenty Years of Theoretical and Practical Synergies, 2024, 265  crossref
  5. Martino Lupini, Alexander Melnikov, Andre Nies, “Computable topological abelian groups”, Journal of Algebra, 615 (2023), 278  crossref
  6. Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander Melnikov, “Computable Stone spaces”, Annals of Pure and Applied Logic, 174:9 (2023), 103304  crossref
  7. Victor Selivanov, “Descriptive complexity of qcb0-spaces”, Theoretical Computer Science, 945 (2023), 113666  crossref
  8. Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon, “On the isomorphism problem for some classes of computable algebraic structures”, Arch. Math. Logic, 61:5-6 (2022), 813  crossref
  9. Nikolay Bazhenov, Manat Mustafa, Anvar Nurakunov, Lecture Notes in Computer Science, 13571, Theory and Applications of Models of Computation, 2022, 79  crossref
  10. Richard Krogman, Douglas Cenzer, “Complexity of injection structures induced by finite state transducers”, Journal of Logic and Computation, 32:8 (2022), 1504  crossref
1
2
3
4
11
Следующая