Lauri Hella
Lauri Hella
Matematiikan professori, Tampereen yliopisto
Verified email at uta.fi - Homepage
TitleCited byYear
Logical hierarchies in PTIME
L Hella
Information and Computation 129 (1), 1-19, 1996
1571996
Logical hierarchies in PTIME
L Hella
Information and Computation 129 (1), 1-19, 1996
1571996
Definability hierarchies of generalized quantifiers.
LT Hella
811990
Logics with aggregate operators
L Hella, L Libkin, J Nurmonen, L Wong
Journal of the ACM (JACM) 48 (4), 880-907, 2001
802001
Notions of locality and their logical characterizations over finite models
L Hella, L Libkin, J Nurmonen
The Journal of Symbolic Logic 64 (4), 1751-1773, 1999
661999
The expressive power of finitely many generalized quantifiers
A Dawar, L Hella
Information and Computation 123 (2), 172-184, 1995
631995
Almost everywhere equivalence of logics in finite model theory
L Hella, PG Kolaitis, K Luosto
Bulletin of Symbolic Logic 2 (4), 422-443, 1996
561996
Inclusion logic and fixed point logic
P Galliani, L Hella
arXiv preprint arXiv:1304.4267, 2013
462013
Weak models of distributed computing, with connections to modal logic
L Hella, M Järvisalo, A Kuusisto, J Laurinharju, T Lempiäinen, K Luosto, ...
Distributed Computing 28 (1), 31-53, 2015
372015
The expressive power of finitely many generalized quantifiers
A Dawar, L Hella
Information and Computation 123 (2), 172-184, 1995
371995
Extended Modal Dependence Logic
J Ebbing, L Hella, A Meier, JS Müller, J Virtema, H Vollmer
International Workshop on Logic, Language, Information, and Computation, 126-137, 2013
352013
The expressive power of modal dependence logic
L Hella, K Luosto, K Sano, J Virtema
arXiv preprint arXiv:1406.6266, 2014
342014
How to define a linear order on finite models
L Hella, PG Kolaitis, K Luosto
Annals of pure and applied logic 87 (3), 241-267, 1997
341997
How to define a linear order on finite models
L Hella, PG Kolaitis, K Luosto
Annals of pure and applied logic 87 (3), 241-267, 1997
341997
Partially ordered connectives and finite graphs
L Hella, G Sandu
Quantifiers: Logics, models and computation, 79-88, 1995
301995
Definability of polyadic lifts of generalized quantifiers
L Hella, J Väänänen, D Westerståhl
Journal of Logic, Language and Information 6 (3), 305-335, 1997
281997
The hierarchy theorem for generalized quantifiers
L Hella, K Luosto, J Väänänen
The Journal of Symbolic Logic 61 (3), 802-817, 1996
271996
Implicit definability and infinitary logic in finite model theory
A Dawar, L Hella, PG Kolaitis
International Colloquium on Automata, Languages, and Programming, 624-635, 1995
261995
Computing queries with higher-order logics
L Hella, JM Turull-Torres
Theoretical Computer Science 355 (2), 197-214, 2006
212006
Modal inclusion logic: Being lax is simpler than being strict
L Hella, A Kuusisto, A Meier, H Vollmer
International Symposium on Mathematical Foundations of Computer Science, 281-292, 2015
162015
The system can't perform the operation now. Try again later.
Articles 1–20