# Locally Finite ω-Languages and Effective Analytic Sets Have the Same Topological Complexity

* Corresponding author
Abstract : Local sentences and the formal languages they define were introduced by Ressayre in [Res88]. We prove that locally finite ω-languages and effective analytic sets have the same topological complexity: the Borel and Wadge hierarchies of the class of locally finite ω-languages are equal to the Borel and Wadge hierarchies of the class of effective analytic sets. In particular, for each non-null recursive ordinal α < ω_1^CK there exist some Σ¨0_α-complete and some Π ^0_α-complete locally finite ω-languages, and the supremum of the set of Borel ranks of locally finite ω-languages is the ordinal γ^1_2 , which is strictly greater than the first non-recursive ordinal ω_1^ CK. This gives an answer to the question of the topological complexity of locally finite ω-languages, which was asked by Simonnet [Sim92] and also by Duparc, Finkel, and Ressayre in [DFR01]. Moreover we show that the topological complexity of a locally finite ω-language defined by a local sentence ϕ may depend on the models of the Zermelo-Fraenkel axiomatic system ZFC. Using similar constructions as in the proof of the above results we also show that the equivalence, the inclusion, and the universality problems for locally finite ω-languages are Π^1_2-complete, hence highly undecidable.
Keywords :
Document type :
Journal articles
Domain :

https://hal.archives-ouvertes.fr/hal-01132963
Contributor : Olivier Finkel <>
Submitted on : Wednesday, March 18, 2015 - 11:55:02 AM
Last modification on : Thursday, April 4, 2019 - 1:33:00 AM
Document(s) archivé(s) le : Monday, June 22, 2015 - 7:07:24 AM

### File

TOPLOC-2 - revised.pdf
Files produced by the author(s)

### Citation

Olivier Finkel. Locally Finite ω-Languages and Effective Analytic Sets Have the Same Topological Complexity. Mathematical Logic Quarterly, Wiley, 2016, 62 (4-5), pp.303-318. ⟨10.1002/malq.201400113⟩. ⟨hal-01132963⟩

Record views