S. Abramsky, A. Dawar, and P. Wang, The pebbling comonad in finite model theory, Logic in Computer Science (LICS), 2017 32nd Annual ACM/IEEE Symposium on, pp.1-12, 2017.

S. Abramsky and N. Shah, Relating structure to power: comonadic semantics for computational resources, Proceedings of Computer Science Logic, 2018.

H. Andréka, I. Németi, and J. Van-benthem, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, vol.27, issue.3, pp.217-274, 1998.

K. Ashok, P. Chandra, and . Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp.77-90, 1977.

P. Hell and J. Nesetril, Graphs and homomorphisms, 2004.

G. Phokion, M. Y. Kolaitis, and . Vardi, Infinitary logics and 0-1 laws. Information and Computation, vol.98, pp.258-294, 1992.

L. Libkin, Elements of Finite Model Theory (Texts in Theoretical Computer Science, An EATCS Series, 2004.

J. N?set?il and P. O. De-mendez, A unified approach to structural limits, and limits of graphs with bounded tree-depth, 2013.

N. Shah, Game comonads in finite model theory. Master's thesis, 2017.

S. Shelah, Every two elementarily equivalent models have isomorphic ultrapowers, Israel Journal of Mathematics, vol.10, issue.2, pp.224-233, 1971.