M. A. Arbib and E. G. Manes, Adjoint machines, state-behavior machines, and duality, Journal of Pure and Applied Algebra, vol.6, issue.3, pp.313-344, 1975.
DOI : 10.1016/0022-4049(75)90028-6

A. Arnold, -calculus alternation-depth hierarchy is strict on binary trees, RAIRO - Theoretical Informatics and Applications, vol.33, issue.4-5, pp.4-5, 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, in : Tree automata and languages, Stud. Comput. Sci. Artificial Intelligence, vol.10, pp.159-188, 1990.

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

A. Arnold and L. Santocanale, Ambiguous Classes in the Games ??-Calculus Hierarchy, FOSSACS 2003 proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, 2003.
DOI : 10.1007/3-540-36576-1_5
URL : https://hal.archives-ouvertes.fr/hal-01288878

A. Arnold and L. Santocanale, Ambiguous classes in µ-calculi hierarchies, Theoretical Computer Science, vol.333, issue.12, pp.265-296, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01261055

M. R. Assous, V. Bouchitté, C. Charretton, and B. Rozoy, Finite labelling problem in event structures, Theoretical Computer Science, vol.123, issue.1, pp.9-19, 1994.
DOI : 10.1016/0304-3975(94)90065-5

D. Baelde and D. Miller, Least and greatest fixed points in linear logic, LPAR, 2007.

M. Barbut and B. Monjardet, Ordre et classification : algèbre et combinatoire . Tomes I et II, méthodes Mathématiques des Sciences de l'Homme, 1970.

W. Belkhir, Algèbre et combinatoire des jeux de parité, 2008.

W. Belkhir and L. Santocanale, The variable hierarchy for the games µcalculus , journal version, submitted to the journal Annals of Pure and Applied Logic, 2008.

W. Belkhir and L. Santocanale, The variable hierarchy for the lattice µcalculus, LPAR 2008 proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, 2008.

M. K. Bennett and G. Birkhoff, Two families of Newman lattices, Algebra Universalis, vol.4, issue.1, pp.115-144, 1994.
DOI : 10.1007/BF01190819

D. 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

D. Berwanger, Games and logical expressiveness, 2005.

D. Berwanger and E. , Entanglement ??? A Measure for the Complexity of Directed Graphs with Applications to Logic and Games, LPAR 2005, pp.209-223, 2005.
DOI : 10.1007/978-3-540-32275-7_15

D. Berwanger, E. Grädel, and G. Lenzi, On the variable hierarchy of the modal mu-calculus, Lect. Not. Comp. Sci, vol.2471, 2002.

D. Berwanger and G. Lenzi, The variable hierarchy of the µ-calculus is strict, STACS 2005, 2005.

M. Bílková, A. Palmigiano, and Y. Venema, Proof systems for the coalgebraic cover modality, Advances in Modal Logic, 2008.

G. Birkhoff and R. I. Lattice-theory, [22] A. Björner, Orderings of Coxeter groups, Combinatorics and algebra, pp.175-195, 1979.

P. Blackburn, M. De-rijke, and Y. Venema, Modal logic of Cambridge Tracts in Theoretical Computer Science, 2001.

W. J. Blok and D. Pigozzi, On the structure of varieties with equationally definable principal congruences. I, Algebra Universalis, pp.195-227, 1982.

S. L. Bloom and Z. Esik, Iteration theories, EATCS Monographs on Theoretical Computer Science, 1993.
DOI : 10.1007/978-3-642-78034-9

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

J. P. Braquelaire and B. Courcelle, The solutions of two star-height problems for regular trees, Theoretical Computer Science, vol.30, issue.2, pp.205-239, 1984.
DOI : 10.1016/0304-3975(84)90063-X

A. Burroni, Récursivité graphique. I. Catégorie des fonctions récursives primitives formelles, Cahiers Topologie Géom, Différentielle Catég, vol.27, issue.1, pp.49-79, 1986.

N. Caspard, A characterization for all interval doubling schemes of the lattice of permutations, Discrete Math, Theor. Comput. Sci, vol.3, issue.4, pp.177-188, 1999.

N. Caspard, THE LATTICE OF PERMUTATIONS IS BOUNDED, International Journal of Algebra and Computation, vol.10, issue.04, pp.481-489, 2000.
DOI : 10.1142/S0218196700000182
URL : https://hal.archives-ouvertes.fr/hal-00095565

N. Caspard, C. Le-conte-de-poly-barbut, and M. Morvan, Cayley lattices of finite Coxeter groups are bounded, Advances in Applied Mathematics, vol.33, issue.1, pp.71-94, 2004.
DOI : 10.1016/j.aam.2003.09.002
URL : https://hal.archives-ouvertes.fr/hal-00095478

N. Caspard and C. Le-conte-poly-barbut, Tamari lattices are bounded : a new proof, 2004.

R. Cockett and L. Santocanale, Induction, Coinduction, and Adjoints, Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(04)80561-9
URL : https://hal.archives-ouvertes.fr/hal-01288863

G. D. Agostino and G. Lenzi, An axiomatization of bisimulation quantifiers via the <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>-calculus, Theoretical Computer Science, vol.338, issue.1-3, pp.64-95, 2005.
DOI : 10.1016/j.tcs.2004.10.040

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

A. Day, A simple solution to the word problem for lattices, Bulletin canadien de math??matiques, vol.13, issue.0, pp.253-254, 1970.
DOI : 10.4153/CMB-1970-051-0

Y. Diers, Familles universelles de morphismes, Ann. Soc. Sci. Bruxelles Sér. I, vol.93, issue.3, pp.175-195, 1979.

R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Math, issue.2, pp.51-161, 1950.

L. C. Eggan, Transition graphs and the star-height of regular events, Michigan Math, J, vol.10, pp.385-397, 1963.

D. M. Gabbay, A general theory of structured consequence relations, Theoria (San Sebastián), vol.10, issue.223, pp.49-78, 1995.

B. Ganter and R. Wille, Formal concept analysis, 1999.

S. Ghilardi and L. Santocanale, Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics, LPAR 2003, No. 2850 in Lecture Notes in Artificial Intelligence proceedings of the 10th International Conference Logic for Programming, 2003.
DOI : 10.1007/978-3-540-39813-4_10
URL : https://hal.archives-ouvertes.fr/hal-01281233

J. Girard, Ludics : an introduction, in : Proof and system-reliability (Marktoberdorf, NATO Sci. Ser. II Math. Phys. Chem., Kluwer Acad. Publ, vol.62, pp.167-211, 2001.

G. Grätzer, General lattice theory, 1998.

K. Hashiguchi, Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1988.
DOI : 10.1016/0890-5401(88)90033-8

P. W. Hoogers, H. C. Kleijn, and P. S. Thiagarajan, An event structure semantics for general Petri nets, Theoretical Computer Science, vol.153, issue.1-2, pp.129-170, 1996.
DOI : 10.1016/0304-3975(95)00120-4

D. Janin and I. Walukiewicz, Automata for the modal mu-calculus and related results, MFCS51] A. Joyal, Free bicomplete categories, pp.219-224, 1995.

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

D. Kozen, Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra, Lecture Notes in Comput. Sci, vol.2010, pp.2001-2028, 2001.
DOI : 10.1007/3-540-44693-1_3

J. Lambeck, Deductive systems and categories III. Cartesian closed categories, intuitionist propositional calculus, and combinatory logic, Lecture Notes in Math, vol.274, pp.57-82, 1971.
DOI : 10.1007/BFb0073965

J. Lambek, Deductive systems and categories, Mathematical Systems Theory, vol.49, issue.4, pp.287-318, 1968.
DOI : 10.1007/BF01703261

J. Lambek, Deductive systems and categories II. Standard constructions and closed categories, pp.76-122, 1968.
DOI : 10.1007/BFb0079385

J. Lambek and P. J. Scott, Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics, vol.7, 1988.

G. Lenzi, A hierarchy theorem for the µ-calculus, ICALP, 1996.

G. Lenzi, The transitive µ-calculus is Büchi definable, WSEAS Trans. Math, vol.5, issue.9, pp.1021-1026, 2006.

R. Mckenzie, Equational bases and nonmodular lattice varieties, Transactions of the American Mathematical Society, vol.174, pp.1-43, 1972.
DOI : 10.1090/S0002-9947-1972-0313141-1

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, CAV, 1992.
DOI : 10.1007/3-540-56496-9_14

K. Ng and A. Tarski, Relational algebras with transitive closure, Notices Amer, Math. Soc, vol.24, pp.29-30

M. Nielsen, G. D. Plotkin, and G. , Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://doi.org/10.1016/0304-3975(81)90112-2

D. Niwi´nskiniwi´nski, Equational ??-calculus, Lecture Notes in Computer Science, vol.208, pp.169-176, 1984.
DOI : 10.1007/3-540-16066-3_16

R. Paré and L. Román, Monoidal categories with natural numbers object, Studia Logica, vol.37, issue.2, pp.361-376, 1989.
DOI : 10.1007/BF00370829

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

V. Pratt, Action logic and pure induction, pp.97-120, 1990.
DOI : 10.1007/BFb0018436

V. Pratt, Dynamic algebras: Examples, constructions, applications, Studia Logica, vol.35, issue.6, pp.3-4, 1991.
DOI : 10.1007/BF00370685

M. O. Rabin, Weakly Definable Relations and Special Automata, Proc. Internat. Colloq, pp.1-23, 1968.
DOI : 10.1016/S0049-237X(08)71929-3

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

L. Santocanale, On the equational definition of the least prefixed point, MFCS 2001, No. 2136 in Lecture Notes in Computer Science procedings of the 26th International Symposium on Mathematical Foundations of Computer Science, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01261158

L. Santocanale, The Alternation Hierarchy for the Theory of mu-lattices, BRICS Report Series, vol.7, issue.29, pp.166-197, 2002.
DOI : 10.7146/brics.v7i29.20163

L. Santocanale, Free ??-lattices, Journal of Pure and Applied Algebra, vol.168, issue.2-3, pp.227-264, 2002.
DOI : 10.1016/S0022-4049(01)00098-6
URL : https://hal.archives-ouvertes.fr/hal-01261049

L. Santocanale, From Parity Games to Circular Proofs, Electronic Notes in Theoretical Computer Science, vol.65, issue.1, 2002.
DOI : 10.1016/S1571-0661(04)80370-0
URL : https://hal.archives-ouvertes.fr/hal-01261240

L. Santocanale, -Bicomplete Categories and Parity Games, RAIRO - Theoretical Informatics and Applications, vol.36, issue.2, pp.195-227, 2002.
DOI : 10.1051/ita:2002010
URL : https://hal.archives-ouvertes.fr/hal-00111230

L. Santocanale, On the equational definition of the least prefixed point, Theoretical Computer Science, vol.295, issue.1-3, pp.341-370, 2003.
DOI : 10.1016/S0304-3975(02)00412-7
URL : https://hal.archives-ouvertes.fr/hal-01261158

L. Santocanale, Completions of µ-algebras, LICS 2005 proceedings of the 20th IEEE Symposium on Logic in Computer Science, pp.26-29, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01288855

L. Santocanale, Topological Properties of Event Structures, Proceedings of the Workshop on Geometrical and Topological Methods in Concurrency, p.6, 2006.
DOI : 10.1016/j.entcs.2009.02.023
URL : https://hal.archives-ouvertes.fr/hal-00432038

L. Santocanale, Derived semidistributive lattices, to appear in the journal Algebra Universalis, 2007.

L. Santocanale, A nice labelling for tree-like event structures of degree 3, CONCUR 2007 proceedings of the 18th International Conference on Concurrency Theory, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00369451

L. Santocanale, On the Join Dependency Relation in Multinomial Lattices, Order, vol.21, issue.2, pp.155-179, 2007.
DOI : 10.1007/s11083-007-9066-0
URL : https://hal.archives-ouvertes.fr/hal-00142355

L. Santocanale, Combinatorics from concurrency : the nice labelling problem for event structures, ROGICS'08 proceedings of the International Conference on Relations , Orders and Graphs : Interaction with Computer Science, pp.12-17, 2008.

L. Santocanale, Completions of <mml:math altimg="si1.gif" display="inline" 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>-algebras, Annals of Pure and Applied Logic, vol.154, issue.1, pp.27-50, 2008.
DOI : 10.1016/j.apal.2007.11.001

L. Santocanale, A nice labelling for tree-like event structures of degree 3, journal version, submitted for a special

K. Segerberg, A completeness theorem in the modal logic of programs, Notices Amer, Math. Soc, vol.24, pp.552-77

E. Soapdc, Volet descriptif du projet soapdc, 2005.

T. Studer, G. Jäger, and M. Kretz, Canonical completeness of infinitary mu

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

W. Tholen, Pro-categories and multiadjoint functors, Canad, J. Math, vol.36, issue.1, pp.144-155, 1984.
DOI : 10.4153/cjm-1984-010-2

W. T. Tutte, Connectivity in graphs, Mathematical Expositions, issue.15, 1966.

Y. Venema, Modal fixpoint logics, talk given at the conference Algebraic and Topological Methods in Non-Classical Logics III (TAN- CL'07), St Anne's College, 2007.

Y. Venema and L. Santocanale, Completeness for flat modal fixpoint logics, LPAR 2007 proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00346782

I. Walukiewicz, Completeness of Kozen's axiomatisation of the propositional ??-calculus, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.142-182, 2000.
DOI : 10.1109/LICS.1995.523240

G. Winskel and M. Nielsen, Models for concurrency, in : Handbook of logic in computer science, Log. Comput. Sci, vol.4, issue.4, pp.1-148, 1995.