Lauri Hella
About me
I am an emeritus professor of mathematics. My research areas are mathematical logic and logic in computer science.
Before retiring I was leading the Tampere Logic Group.
Research topics
Definability theory of generalized quantifiers
Ehrenfeucht-Fraisse games and formula size games, and their applications
Descriptive complexity theory: logical characterizations of complexity classes
Modal and first-order dependence logics and team semantics
Research fields
Mathematics, theoretical computer science
Selected publications
L. Hella: Definability hierarchies of generalized quantiers. Annals of Pure and Applied Logic 43 (1989): 235-271.
L. Hella: Logical hierarchies in PTIME. Information and Computation 129 (1996): 1-19.
L. Hella, L. Libkin, J. Nurmonen, and L. Wong: Logics with aggregate operators. Journal of the ACM 48 (2001): 880-907.
P. Galliani and L. Hella: Inclusion logic and fixed point logic. Proc. 22th Annual Conference the EACSL (CSL), 2013, pages 281-295.
L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen, K. Luosto, J. Suomela, and J. Virtema: Weak models of distributed computing, with connections to modal logic. Distributed Computing 28(1) (2015): 31-53.
L. Hella and A. Kuusisto: Existential second-order logic and modal logic with quantified accessibility relations. Information and Computation 247 (2016): 217-234.
Latest publications
Dimension in team semantics
Hella, L., Luosto, K. & Väänänen, J., 2024, (E-pub ahead of print) In: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE.Research output: Contribution to journal › Article › Scientific › peer-review
Game characterizations for the number of quantifiers
Hella, L. & Luosto, K., 2024, (E-pub ahead of print) In: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE.Research output: Contribution to journal › Article › Scientific › peer-review
Quantifiers Closed Under Partial Polymorphisms
Dawar, A. & Hella, L., Feb 2024, 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024. Murano, A. & Silva, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 288).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
A Completeness Proof for a Regular Predicate Logic with Undefined Truth Value
Valmari, A. & Hella, L., 2023, In: NOTRE DAME JOURNAL OF FORMAL LOGIC. 64, 1, p. 61-93 33 p.Research output: Contribution to journal › Article › Scientific › peer-review
Descriptive Complexity for Distributed Computing with Circuits
Ahvonen, V., Heiman, D., Hella, L. & Kuusisto, A., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
The Expressive Power of CSP-Quantifiers
Hella, L., 1 Feb 2023, 31st EACSL Annual Conference on Computer Science Logic, CSL 2023. Klin, B. & Pimentel, E. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 25. (Leibniz International Proceedings in Informatics; vol. 252).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Bounded game-theoretic semantics for modal mu-calculus
Hella, L., Kuusisto, A. & Rönnholm, R., 2022, In: Information and Computation. 289, B, 19 p., 104882.Research output: Contribution to journal › Article › Scientific › peer-review
Complexity thresholds in inclusion logic
Hannula, M. & Hella, L., 2022, In: Information and Computation. 287, 104759.Research output: Contribution to journal › Article › Scientific › peer-review
Defining Long Words Succinctly in FO and MSO
Hella, L. & Vilander, M., 2022, Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings. Berger, U., Franklin, J. N. Y., Manea, F. & Pauly, A. (eds.). Springer, p. 125-138 14 p. (Lecture Notes in Computer Science; vol. 13359).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Independence-friendly logic without Henkin quantification
Barbero, F., Hella, L. & Rönnholm, R., 16 Jun 2021, In: Archive for Mathematical Logic.Research output: Contribution to journal › Article › Scientific › peer-review