The Beth-Closure of L(Qalpha) Is Not Finitely Generated. - Lauri Hella; Kerkko Luosto (J. Symb. Log., 1992)

Almost everywhere equivalence of logics in finite model theory. - Lauri Hella; Phokion G. Kolaitis; Kerkko Luosto (Bull. Symb. Log., 1996)

The Hierarchy Theorem for Generalized Quantifiers. - Lauri Hella; Kerkko Luosto; Jouko A. Väänänen (J. Symb. Log., 1996)

Ramsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers. - Kerkko Luosto (ESSLLI, 1997)

How to Define a Linear Order on Finite Models. - Lauri Hella; Phokion G. Kolaitis; Kerkko Luosto (Ann. Pure Appl. Log., 1997)

Hierarchies of Monadic Generalized Quantifiers. - Kerkko Luosto (J. Symb. Log., 2000)

Equicardinality on Linear Orders. - Kerkko Luosto (LICS, 2004)

On vectorizations of unary generalized quantifiers. - Kerkko Luosto (Arch. Math. Log., 2012)

The Expressive Power of Modal Dependence Logic. - Lauri Hella; Kerkko Luosto; Katsuhiko Sano; Jonni Virtema (Advances in Modal Logic, 2014)

Weak models of distributed computing, with connections to modal logic. - Lauri Hella; Matti Järvisalo; Antti Kuusisto; Juhana Laurinharju; Tuomo Lempiäinen; Kerkko Luosto; Jukka Suomela; Jonni Virtema (Distributed Comput., 2015)

Regular Representations of Uniform TC^0. - Lauri Hella; Juha Kontinen; Kerkko Luosto (CoRR, 2023)

Game characterizations for the number of quantifiers. - Lauri Hella; Kerkko Luosto (Math. Struct. Comput. Sci., 2024)

Dimension in team semantics. - Lauri Hella; Kerkko Luosto; Jouko Väänänen (Math. Struct. Comput. Sci., 2024)