Aleksander Ivanov. The complexity of countable categoricity in finite languages. Math. Log. Q., 58(1-2):105-112, 2012. [doi]
@article{Ivanov12-1,
title = {The complexity of countable categoricity in finite languages},
author = {Aleksander Ivanov},
year = {2012},
doi = {10.1002/malq.201110035},
url = {http://dx.doi.org/10.1002/malq.201110035},
researchr = {https://researchr.org/publication/Ivanov12-1},
cites = {0},
citedby = {0},
journal = {Math. Log. Q.},
volume = {58},
number = {1-2},
pages = {105-112},
}