Local sentences and the formal languages they define were introduced by Ressayre in [28]. We prove that locally finite omega-languages and effective analytic sets have the same topological complexity: the Borel and Wadge hierarchies of the class of locally finite omega-languages are equal to the Borel andWadge hierarchies of the class of effective analytic sets. In particular, for each non-null recursive ordinala alpha 展开▼
