M. Viswanathan and R. Viswanathan, A Higher Order Modal Fixed Point Logic, In: CONCUR. LNCS, vol.5, pp.512-528, 2004.
DOI : 10.2140/pjm.1955.5.285

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

R. Axelsson, M. Lange, and R. Somla, The Complexity of Model Checking Higher-Order Fixpoint Logic, Logical Methods in Computer Science, vol.3, issue.2, pp.1-33, 2007.
DOI : 10.2168/LMCS-3(2:7)2007

R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, Complexity and Computation, vol.7, pp.43-73, 1974.

L. J. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science, vol.3, issue.1, pp.1-22, 1976.
DOI : 10.1016/0304-3975(76)90061-X

N. Immerman, Languages that Capture Complexity Classes, SIAM Journal on Computing, vol.16, issue.4, pp.760-778, 1987.
DOI : 10.1137/0216051

S. Abiteboul and V. Vianu, Computing with First-Order Logic, Journal of Computer and System Sciences, vol.50, issue.2, pp.309-335, 1995.
DOI : 10.1006/jcss.1995.1025

M. Y. Vardi, The complexity of relational query languages (Extended Abstract), Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.137-146, 1982.
DOI : 10.1145/800070.802186

N. Immerman, Relational queries computable in polynomial time, Information and Control, vol.68, issue.1-3, pp.1-3, 1986.
DOI : 10.1016/S0019-9958(86)80029-8

N. Immerman, Descriptive Complexity, 1999.
DOI : 10.1007/978-1-4612-0539-5

E. Grädel, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer et al., Finite Model Theory and its Applications, 2007.

M. Otto, Bisimulation-invariant PTIME and higher-dimensional ??-calculus, Theoretical Computer Science, vol.224, issue.1-2, pp.237-265, 1999.
DOI : 10.1016/S0304-3975(98)00314-4

H. R. Andersen, A polyadic modal µ-calculus, 1994.

R. Milner, Communication and Concurrency. International Series in Computer Science, 1989.

C. Stirling, Modal and Temporal Properties of Processes, Texts in Computer Science, 2001.
DOI : 10.1007/978-1-4757-3550-5

E. Grädel, Capturing complexity classes by fragments of second order logic, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pp.35-57, 1992.
DOI : 10.1109/SCT.1991.160279

N. Kobayashi, K. Inaba, and T. Tsukada, Unsafe Order-2 Tree Languages Are Context-Sensitive, FoSSaCS. Lecture Notes in Computer Science, vol.8412, pp.149-163, 2014.
DOI : 10.1007/978-3-642-54830-7_10

M. Lange and E. Lozes, Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
DOI : 10.1007/978-3-662-44602-7_8
URL : https://hal.archives-ouvertes.fr/hal-01402031

A. R. Meyer and L. J. Stockmeyer, Word problems requiring exponential time, pp.1-9, 1973.

A. Tarski, C. Alvarez, J. L. Balcázar, J. Gabarró, and M. Santha, A lattice-theoretical fixpoint theorem and its applications, Parallel Architectures and Languages Europe, PARLE'91, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285