1. Blumensath, A., Colcombet, T., & Löding, C. (2008). Logical theories and compatible operations. Logic and Automata, 2, 73–106.
2. Courcelle, B., Makowsky, J. A., & Rotics, U. (2000). Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2), 125–150.
3. Dawar, A., Grohe, M., Kreutzer, S., & Schweikardt, N. (2007). Model theory makes formulas large. In International Colloquium on Automata, Languages, and Programming (pp. 913–924).
4. Droste, M., & Paul, E. (2018). A feferman-vaught decomposition theorem for weighted mso logic. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
5. Elberfeld, M., Grohe, M., & Tantau, T. (2016). Where first-order and monadic second-order logic coincide. ACM Transactions on Computational Logic (TOCL), 17(4), 1–18.