10 citations to 10.2178/jsl/1203350796 (Crossref Cited-By Service)

1. Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124  
2. MATTHEW HARRISON-TRAINOR, “AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS”, Bull. symb. log, 28, no. 1, 2022, 71  
3. Matthew Harrison-Trainor, “There is no classification of the decidably presentable structures”, J. Math. Log., 18, no. 02, 2018, 1850010  
4. N. A. Bazhenov, “Computable Numberings of the Class of Boolean Algebras with Distinguished Endomorphisms”, Algebra Logic, 52, no. 5, 2013, 355  
5. Ekaterina B. Fokina, Sy‐David Friedman, “On Σ11 equivalence relations over the natural numbers”, Mathematical Logic Qtrly, 58, no. 1-2, 2012, 113  
6. Margarita Korovina, Oleg Kudinov, 8974, Perspectives of System Informatics, 2015, 201  
7. Margarita Korovina, Oleg Kudinov, 10742, Perspectives of System Informatics, 2018, 241  
8. Margarita Korovina, Oleg Kudinov, 9136, Evolving Computability, 2015, 226  
9. MARGARITA KOROVINA, OLEG KUDINOV, “Computable elements and functions in effectively enumerable topological spaces”, Math. Struct. Comp. Sci., 27, no. 8, 2017, 1466  
10. Wesley Calvert, Valentina Harizanov, Alexandra Shlapentokh, “Computability in infinite Galois theory and algorithmically random algebraic fields”, Journal of London Math Soc, 110, no. 5, 2024, e70017