14 citations to 10.2178/jsl/1082418544 (Crossref Cited-By Service)
  1. Peter A. Cholak, Rodney Downey, Leo A. Harrington, “The Complexity of Orbits of Computably Enumerable Sets”, Bull. symb. log., 14, no. 1, 2008, 69  crossref
  2. Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124  crossref
  3. J. Johnson, J. F. Knight, V. Ocasio, J. Tussupov, S. VanDenDriessche, “Preserving Categoricity and Complexity of Relations”, Algebra Logic, 54, no. 2, 2015, 140  crossref
  4. Ekaterina Fokina, Dino Rossegger, Luca San Mauro, “Bi‐embeddability spectra and bases of spectra”, Mathematical Logic Qtrly, 65, no. 2, 2019, 228  crossref
  5. W. Calvert, S. S. Goncharov, J. F. Knight, Jessica Millar, “Categoricity of computable infinitary theories”, Arch. Math. Logic, 48, no. 1, 2009, 25  crossref
  6. Wesley Calvert, Douglas Cenzer, Valentina Harizanov, Andrei Morozov, “Effective categoricity of equivalence structures”, Annals of Pure and Applied Logic, 141, no. 1-2, 2006, 61  crossref
  7. Peter Cholak, Rodney Downey, Leo Harrington, “On the orbits of computably enumerable sets”, J. Amer. Math. Soc., 21, no. 4, 2008, 1105  crossref
  8. Julia F. Knight, Vikram Saraph, “Scott sentences for certain groups”, Arch. Math. Logic, 57, no. 3-4, 2018, 453  crossref
  9. Sergei S. Goncharov, 5, Mathematical Problems from Applied Logic II, 2007, 99  crossref
  10. Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei Morozov, “Effective categoricity of Abelian p-groups”, Annals of Pure and Applied Logic, 159, no. 1-2, 2009, 187  crossref
1
2
Next