S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

S. Abramsky and P. Es, Concurrent games and full completeness, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.431-442, 1999.
DOI : 10.1109/LICS.1999.782638
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4577

A. Andersen, Model checking and Boolean graphs [ MR1249946 (94i:03045)], Theoret, Seventeenth Colloquium on Trees in Algebra and Programming (CAAP '92) and European Symposium on Programming (ESOP), pp.3-30, 1992.
DOI : 10.1016/0304-3975(94)90266-6
URL : http://doi.org/10.1016/0304-3975(94)90266-6

A. Arnold, The µ-calculus alternation-depth is strict on binary trees, RAIRO-Informatique théorique 33, pp.329-339, 1999.

A. Arnold and L. Santocanale, Ambiguous Classes in the Games ??-Calculus Hierarchy, Lect. Not. Comp. Sci, vol.2620, pp.70-86, 2003.
DOI : 10.1007/3-540-36576-1_5
URL : https://hal.archives-ouvertes.fr/hal-01288878

B. [. Braquelaire and . Courcelle, The solutions of two starheight problems for regular trees, Theoret. Comput. Sci, vol.3086, issue.2, pp.205-239, 1984.

[. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer, DAG-Width and Parity Games, STACS, Lect. Not
DOI : 10.1007/11672142_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.9018

[. Berwanger, Game logic is strong enough for parity games, Special issue on Game Logic and Game Algebra, pp.205-219, 2003.
DOI : 10.1023/A:1027358927272

[. Berwanger, E. Grädel, and G. Lenzi, The Variable Hierarchy of the ??-Calculus Is Strict, Theory of Computing Systems, vol.40, issue.4, pp.437-466, 2007.
DOI : 10.1007/s00224-006-1317-8

[. Berwanger and G. Lenzi, The Variable Hierarchy of the ??-Calculus Is Strict, STACS 2005, pp.97-109, 2005.
DOI : 10.1007/978-3-540-31856-9_8

C. Julian and . Bradfield, The modal µ-calculus alternation hierarchy is strict, Theor. Comput. Sci, vol.195, issue.2, pp.133-153, 1998.

[. Belkhir and L. Santocanale, The variable hierarchy of games µ-calculus is infinite

[. Burris and H. P. Sankappanavar, A course in universal algebra, Graduate Texts in Mathematics, vol.78, p.64828708001, 1981.
DOI : 10.1007/978-1-4613-8130-3

[. Belkhir and L. Santocanale, Undirected Graphs of Entanglement 2, Lect. Not. Comp. Sci, vol.4855, pp.508-519, 2007.
DOI : 10.1007/978-3-540-77050-3_42

[. Belkhir and L. Santocanale, The Variable Hierarchy for the Lattice ??-Calculus, Lect. Not. Comp. Sci, pp.605-620, 2008.
DOI : 10.1007/978-3-540-89439-1_42

H. Beki?, Definable operation in general algebras, and the theory of automata and flowcharts, Programming Languages and Their Definition -Hans Bekic, pp.30-55, 1936.

V. Chepoi and F. Dragan, Finding a central vertex in an HHD-free graph, Discrete Applied Mathematics, vol.131, issue.1, pp.93-111, 2003.
DOI : 10.1016/S0166-218X(02)00419-5

N. Caspard, B. Leclerc, and B. Monjardet, Ensembles ordonnés finis : concepts, résultats et usages, 2007.

H. Thomas, C. E. Cormen, R. L. Leiserson, and . Rivest, Introduction to algorithms, The MIT Electrical Engineering and Computer Science Series, 1990.

[. Courcelle, Graph rewriting: an algebraic and logic approach , Handbook of theoretical computer science, pp.193-242, 1990.

A. C. Davis, A characterization of complete lattices, Pacific Journal of Mathematics, vol.5, issue.2, pp.311-319, 1955.
DOI : 10.2140/pjm.1955.5.311

[. Dalmau, P. G. Kolaitis, and M. Y. Vardi, Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics, CP '02: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, pp.310-326, 2002.
DOI : 10.1007/3-540-46135-3_21

H. [. Davey and . Priestley, Introduction to lattices and order , Cambridge Mathematical Textbooks, p.1058437, 1990.

[. Droms, B. Servatius, and H. Servatius, The structure of locally finite two-connected graphs, Research Paper 17, approx. 10 pp. (electronic). MR MR1346878, p.5124, 1995.

]. A. Ehr61 and . Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund, Math, vol.49, pp.129-141, 1960.

[. Emerson and C. Lei, Efficient model checking in fragments of the propositional mu-calculus (extended abstract, LICS, pp.267-278, 1986.

[. Freese, J. Je?ek, and J. B. , Nation, Free lattices, Mathematical Surveys and Monographs, vol.4296, p.131981506013, 1995.

[. Festa, P. M. Pardalos, and M. G. Resende, Feedback set problems, Handbook of combinatorial optimization, pp.209-258, 1999.

R. Fra¨?sséfra¨?ssé, Sur quelques classifications des systèmes de relations , Thèse, 1953.

[. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.101-89926903057, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

E. Goubault and M. Raußen, Dihomotopy as a Tool in State Space Analysis Tutorial, LATIN, Lect. Not. Comp. Sci, vol.2286, pp.16-37, 2002.
DOI : 10.1007/3-540-45995-2_8

[. Grädel, Automata , logics, and infinite games A guide to current research, Lecture Notes in Computer Science, vol.2500, p.207073168009, 2002.

]. L. Hen61 and . Henkin, Some remarks on infinitely long formulas Infinitistic Methods, Proc. Sympos. Foundations of Math, pp.167-183, 1959.

C. [. Hyland and . Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

[. Hohberg, The decomposition of graphs into k-connected components, Discrete Math, pp.133-145, 1992.

N. Immerman, Descriptive complexity: A logician's approach to computation, Notices of the, pp.1127-1133, 1995.
DOI : 10.1007/978-1-4612-0539-5

G. Japaridze, Introduction to computability logic, Annals of Pure and Applied Logic, vol.123, issue.1-3
DOI : 10.1016/S0168-0072(03)00023-X

S. [. Jamison and . Olariu, On the semi-perfect elimination, Advances in Applied Mathematics, vol.9, issue.3, pp.364-376, 1988.
DOI : 10.1016/0196-8858(88)90019-X

]. A. Joy77, Remarques sur la théorie des jeuxàjeuxà deux personnes, La Gazette des Sciences Mathématiques du Québec, vol.1, issue.4, 1977.

]. A. Joy97 and . Lib, Free lattices, communication and money games, Logic and scientific methods, Synthese, pp.29-68, 1995.

[. Jurdzi´nskijurdzi´nski, Small progress measures for solving parity games, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, Lect. Not. Comp. Sci, pp.290-301, 2000.

[. Jurdzinski, Small Progress Measures for Solving Parity Games, STACS, Lect. Not. Comp. Sci, vol.1770, pp.290-301, 2000.
DOI : 10.1007/3-540-46541-3_24

D. Janin and I. Walukiewicz, Automata for the modal mucalculus and related results, MFCS '95: Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, pp.552-562, 1995.

[. Krivine and Y. Legrandgérard, Valid formulas, games and network protocols, p.1480, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00166880

]. B. Bibliography-[-kna27 and . Knaster, Une théorème sur les fonctions d'ensembles, Annales Soc. Polonaise Math, vol.6, pp.133-134, 1927.

[. Kozen, Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983.
DOI : 10.7146/dpb.v11i146.7420

]. K. Kur30 and . Kuratowski, Sur leprobì eme des courbes gauches en topologie, Fund, Math, vol.16, pp.271-283, 1930.

[. Lenzi, Automata, languages and programming, 23rd international colloquium, icalp96, paderborn, germany, Lecture Notes in Computer Science, vol.1099, pp.8-12, 1996.

[. Mortimer, On languages with two variables, Mathematical Logic Quarterly, vol.27, issue.1, pp.135-140, 1975.
DOI : 10.1002/malq.19750210118

[. Niwi´nskiniwi´nski, Equational µ-calculus, Computation theory (Zaborów, Lecture Notes in Comput. Sci, vol.20887, pp.169-176, 1984.

[. Niwinski, On fixed-point clones, pp.464-473, 1986.
DOI : 10.1007/3-540-16761-7_96

A. [. Nerode, V. Yakhnis, and . Yakhnis, Concurrent Programs as Strategies in Games, Logic from Computer Science: Proc. of a Workshop, pp.405-479, 1992.
DOI : 10.1007/978-1-4612-2822-6_17

]. J. Obd03 and . Obdr?álek, Fast mu-calculus model checking when tree-width is bounded, Lect. Not. Comp. Sci, vol.2725, issue.03, pp.80-92, 2003.

]. J. Obd06 and . Obdr?álek, DAG-width ? connectivity measure for directed graphs, Symposium on Discrete Algorithms, pp.814-821, 2006.

[. Obdr?álek, Clique-width and parity games, CSL'07, LNCS, vol.4646, pp.54-68, 2007.

[. Park, Concurrency and automata on infinite sequences, Proceedings of the 5th GI-Conference on Theoretical Computer Science, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

[. Parikh, The logic of games and its applications foundations of computation theory " on Topics in the theory of computation, pp.111-139, 1985.

M. Pauly and R. Parikh, Game logic?an overview Game logic and game algebra, Studia Logica, vol.75, issue.2, pp.165-182, 2001.
DOI : 10.1023/A:1027354826364

R. Vaughan and . Pratt, A decidable mu-calculus: Preliminary report, FOCS, pp.421-427, 1981.

R. Richter, Decomposing infinite 2-connected graphs into 3-connected components, Electr. J. Comb, vol.11, issue.1, 2004.

. [. De-rijke-and-maarten-de-rijke, Modal model theory, Annals of Pure and Applied Logic, 1995.

[. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

[. Robertson and P. Seymour, Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering, Journal of Combinatorial Theory, Series B, vol.89, issue.1, pp.77-108, 2003.
DOI : 10.1016/S0095-8956(03)00067-4

[. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001

. B. R?-s94-]-r, P. D. Richter, J. Seymour, and . Sirá?, Circular embeddings of planar graphs in nonspherical surfaces, Discrete Math, pp.273-280, 1994.

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

L. Santocanale, Sur les µ-treillis libres, 2000.

]. D. See91 and . Seese, The structure of the models of decidable monadic theories of graphs, Ann. Pure Appl. Logic, vol.53, issue.2, pp.169-195, 1991.

]. P. Sey81 and . Seymour, Some applications of matroid decomposition Algebraic methods in graph theory, Colloq. Math. Soc. János Bolyai, pp.713-726, 1978.

[. Stirling, Modal and temporal properties of processes, 2001.
DOI : 10.1007/978-1-4757-3550-5

]. A. Tar55 and . Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math, vol.5, pp.285-309, 1955.

]. W. Tut66 and . Tutte, Connectivity in graphs, Mathematical Expositions, issue.15, 1966.

Y. Venema, Automata and fixed point logic: A coalgebraic perspective, Information and Computation, vol.204, issue.4, pp.637-678, 2006.
DOI : 10.1016/j.ic.2005.06.003

M. Philip and . Whitman, Free lattices, Ann. of Math, issue.22, pp.42-325, 1941.