Definability Hierarchies of Generalized Quantifiers. - Lauri Hella (Ann. Pure Appl. Log., 1989)

Remarks on The Cartesian Closure. - Lauri Hella; Michal Krynicki (Math. Log. Q., 1991)

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

Implicit Definability and Infinitary Logic in Finite Model Theory. - Anuj Dawar; Lauri Hella; Phokion G. Kolaitis (ICALP, 1995)

The expressive Power of Finitely Many Generalized Quantifiers. - Anuj Dawar; Lauri Hella (Inf. Comput., 1995)

A double arity hierarchy theorem for transitive closure logic. - Martin Grohe; Lauri Hella (Arch. Math. Log., 1996)

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

Logical Hierarchies in PTIME. - Lauri Hella (Inf. Comput., 1996)

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

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

Definability of Polyadic Lifts of Generalized Quantifiers. - Lauri Hella; Jouko A. Väänänen; Dag Westerståhl (J. Log. Lang. Inf., 1997)

Ordering Finite Variable Types with Generalized Quantifiers. - Anuj Dawar; Lauri Hella; Anil Seth (LICS, 1998)

Enhancing Fixed Point Logic with Cardinality Quantifiers. - Lauri Hella; Henrik Imhof (J. Log. Comput., 1998)

Capturing Relativized Complexity Classes without Order. - Anuj Dawar; Georg Gottlob; Lauri Hella (Math. Log. Q., 1998)

Notions of Locality and Their Logical Characterizations over Finite Models. - Lauri Hella; Leonid Libkin; Juha Nurmonen (J. Symb. Log., 1999)

Approximate Pattern Matching is Expressible in Transitive Closure Logic. - Kjell Lemström; Lauri Hella (LICS, 2000)

Vectorization hierarchies of some graph quantifiers. - Lauri Hella; Juha Nurmonen (Arch. Math. Log., 2000)

Logics with aggregate operators. - Lauri Hella; Leonid Libkin; Juha Nurmonen; Limsoon Wong (J. ACM, 2001)

Quantifying over Quantifiers. - Lauri Hella (WoLLIC, 2003)

Expressibility of Higher Order Logics. - Lauri Hella; Jose Maria Turull Torres (WoLLIC, 2003)

Approximate pattern matching and transitive closure logics. - Kjell Lemström; Lauri Hella (Theor. Comput. Sci., 2003)

Complete Problems for Higher Order Logics. - Lauri Hella; Jose Maria Turull Torres (CSL, 2006)

Computing queries with higher-order logics. - Lauri Hella; Jose Maria Turull Torres (Theor. Comput. Sci., 2006)

Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. - Miguel Couceiro; Lauri Hella; Jari Kivelä (Log. J. IGPL, 2008)

Partially Ordered Connectives and Monadic Monotone Strict NP. - Lauri Hella; Merlijn Sevenster; Tero Tulenheimo (J. Log. Lang. Inf., 2008)

Monadic Sigma11 and Modal Logic with Quantified Binary Relations. - Lauri Hella; Antti Kuusisto (M4M, 2009)

The size of a formula as a measure of complexity - Lauri Hella; Jouko A. Väänänen (CoRR, 2012)

Inclusion Logic and Fixed Point Logic. - Pietro Galliani; Lauri Hella (CSL, 2013)

Extended Modal Dependence Logic. - Johannes Ebbing; Lauri Hella; Arne Meier; Julian-Steffen Müller; Jonni Virtema; Heribert Vollmer (WoLLIC, 2013)

On the existence of a modal-logical basis for monadic second-order logic. - Lauri Hella; Tero Tulenheimo (J. Log. Comput., 2013)

One-dimensional Fragment of First-order Logic. - Lauri Hella; Antti Kuusisto (Advances in Modal Logic, 2014)

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

The Size of a Formula as a Measure of Complexity. - Lauri Hella; Jouko Väänänen (Logic Without Borders, 2015)

Modal Inclusion Logic: Being Lax is Simpler than Being Strict. - Lauri Hella; Antti Kuusisto; Arne Meier; Heribert Vollmer (MFCS (1), 2015)

The expressive power of modal logic with inclusion atoms. - Lauri Hella; Johanna Stumpf (GandALF, 2015)

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)

The succinctness of first-order logic over modal logic via a formula size game. - Lauri Hella; Miikka Vilander (Advances in Modal Logic, 2016)

Dependence Logic vs. Constraint Satisfaction. - Lauri Hella; Phokion G. Kolaitis (CSL, 2016)

Existential second-order logic and modal logic with quantified accessibility relations. - Lauri Hella; Antti Kuusisto (Inf. Comput., 2016)

Boolean dependence logic and partially-ordered connectives. - Johannes Ebbing; Lauri Hella; Peter Lohmann; Jonni Virtema (J. Comput. Syst. Sci., 2017)

Model checking and validity in propositional and modal inclusion logics. - Lauri Hella; Antti Kuusisto; Arne Meier; Jonni Virtema (J. Log. Comput., 2019)

Formula size games for modal logic and μ-calculus. - Lauri Hella; Miikka Vilander (J. Log. Comput., 2019)

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. - Lauri Hella; Antti Kuusisto; Raine Rönnholm (GandALF, 2020)

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. - Lauri Hella; Antti Kuusisto; Arne Meier; Heribert Vollmer (ACM Trans. Comput. Log., 2020)

Independence-friendly logic without Henkin quantification. - Fausto Barbero; Lauri Hella; Raine Rönnholm (Arch. Math. Log., 2021)

A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. - Antti Valmari; Lauri Hella (CoRR, 2021)

Complexity thresholds in inclusion logic. - Miika Hannula; Lauri Hella (Inf. Comput., 2022)

Bounded game-theoretic semantics for modal mu-calculus. - Lauri Hella; Antti Kuusisto; Raine Rönnholm (Inf. Comput., 2022)

The Expressive Power of CSP-Quantifiers. - Lauri Hella (CSL, 2023)

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

Quantifiers Closed Under Partial Polymorphisms. - Anuj Dawar; Lauri Hella (CSL, 2024)

Defining long words succinctly in FO and MSO. - Lauri Hella; Miikka Vilander (Comput., 2024)

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)

Descriptive complexity for distributed computing with circuits. - Veeti Ahvonen; Damian Heiman; Lauri Hella; Antti Kuusisto (J. Log. Comput., 2025)