Classical and Effective Descriptive Complexities of omega-Powers

Olivier Finkel (1, 2) , Dominique Lecomte (3)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 ELM - Équipe de Logique Mathématique
3 IMJ - Institut de Mathématiques de Jussieu

We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove effective versions of these results. In particular, for each non null recursive ordinal alpha, there exists a recursive finitary language A such that A^omega is Sigma^0_alpha-complete (respectively, Pi^0_alpha-complete). To do this, we prove effective versions of a result by Kuratowski, describing a Borel set as the range of a closed subset of the Baire space by a continuous bijection. This leads us to prove closure properties for the classes Effective-Pi^0_alpha and Effective-Sigma^0_alpha of the hyperarithmetical hierarchy in arbitrary recursively presented Polish spaces. We apply our existence results to get better computations of the topological complexity of some sets of dictionaries considered by the second author in [Omega-Powers and Descriptive Set Theory, Journal of Symbolic Logic, Volume 70 (4), 2005, p. 1210-1232].

Mots clés: omega-power; Borel class; complete; effective descriptive set theory; hyperarithmetical hierarchy; hyperarithmetical hierarchy.

Domaines: Logique [math.LO]; Logique en informatique [cs.LO]; Complexité [cs.CC]

Olivier Finkel, Dominique Lecomte. Classical and Effective Descriptive Complexities of omega-Powers. Annals of Pure and Applied Logic, 2009, 160 (2), pp.163-191. ⟨ensl-00168644v2⟩