Janin, D. and Lenzi, G. 2012. On the logical definability of topologically closed recognizable languages of infinite trees. Computing and Informatics. 21, 3 (Feb. 2012), 185–203.