J. W. Addison, Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic, Annals of Pure and Applied Logic, vol.126, issue.1-3, pp.126-77, 2004.
DOI : 10.1016/j.apal.2003.10.009

A. Arnold, -calculus alternation-depth hierarchy is strict on binary trees, RAIRO-Theoretical Informatics and Applications, pp.329-339, 1999.
DOI : 10.1051/ita:1999121
URL : https://hal.archives-ouvertes.fr/hal-01357275

A. Arnold and D. Niwi´nskiniwi´nski, Fixed point characterization of weak monadic logic definable sets of trees, Tree Automata and Languages, pp.159-188, 1992.

A. Arnold and D. Niwi´nskiniwi´nski, Rudiments of µ-Calculus, Studies in Logic and the Foundations of Mathematics, 2001.

A. Arnold and D. Niwi´nskiniwi´nski, Fixed point characterization of Büchi automata on infinite trees, J. Inf. Process. Cybern. EIK, vol.26, pp.453-461, 1990.

H. Becker, Some examples of Borel-inseparable pairs of coanalylic sets, Mathematika, vol.27, issue.01, pp.72-79, 1986.
DOI : 10.1007/BFb0076223

J. C. Bradfield, The modal mu-calculus alternation hierarchy is strict, Theoretical Computer Science, vol.195, issue.2, pp.133-153, 1997.
DOI : 10.1016/S0304-3975(97)00217-X

J. C. Bradfield, Simplifying the modal mu-calculus alternation hierarchy, Proc. STACS'98, pp.1373-1412, 1998.
DOI : 10.1007/BFb0028547

T. Colcombet and C. Löding, The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata, Proc. ICALP, pp.398-409, 2008.
DOI : 10.1007/978-3-540-70583-3_33
URL : https://hal.archives-ouvertes.fr/hal-00347194

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.368-377, 1991.
DOI : 10.1109/SFCS.1991.185392

A. S. Kechris, Classical descriptive set theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

D. E. Muller, A. Saoudi, and P. E. Schupp, Alternating automata, the weak monadic theory of trees and its complexity, Theoretical Computer Science, vol.97, issue.2, pp.233-244, 1992.
DOI : 10.1016/0304-3975(92)90076-R

D. Niwi´nskiniwi´nski, On fixed point clones, Lect. Notes Comput. Sci, vol.86, issue.226, pp.464-473, 1986.

D. Niwi´nskiniwi´nski and I. Walukiewicz, A gap property of deterministic tree languages, Theoretical Computer Science, vol.303, issue.1, pp.215-231, 2003.
DOI : 10.1016/S0304-3975(02)00452-8

M. O. Rabin, Weakly Definable Relations and Special Automata, Mathematical Logic and Foundations of Set Theory, pp.1-23, 1970.
DOI : 10.1016/S0049-237X(08)71929-3

J. Raymond, Complete pairs of coanalytic sets, Fundamenta Mathematicae, vol.194, issue.3, pp.267-281, 2007.
DOI : 10.4064/fm194-3-4

L. Santocanale and A. Arnold, Ambiguous classes in <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculi hierarchies, Theoretical Computer Science, vol.333, issue.1-2, pp.265-296, 2005.
DOI : 10.1016/j.tcs.2004.10.024

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Languages, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7