- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j22 |      | Lauri Hella, Tero Tulenheimo: On the existence of a modal-logical basis for monadic second-order logic. J. Log. Comput. 23(1): 157-180 (2013) |
| i3 | | |
| 2012 | ||
| c9 | | Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema: Weak models of distributed computing, with connections to modal logic. PODC 2012: 185-194 |
| i2 | | Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema: Weak Models of Distributed Computing, with Connections to Modal Logic. CoRR abs/1205.2051 (2012) |
| i1 | | Lauri Hella, Jouko A. Väänänen: The size of a formula as a measure of complexity. CoRR abs/1208.4803 (2012) |
| 2010 | ||
| j21 | | Lauri Hella, Antti Kuusisto: Monadic Sigma11 and Modal Logic with Quantified Binary Relations. Electr. Notes Theor. Comput. Sci. 262: 173-188 (2010) |
| 2008 | ||
| j20 | | Miguel Couceiro, Lauri Hella, Jari Kivelä: Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. Logic Journal of the IGPL 16(1): 43-73 (2008) |
| j19 | | Lauri Hella, Merlijn Sevenster, Tero Tulenheimo: Partially Ordered Connectives and Monadic Monotone Strict NP. Journal of Logic, Language and Information 17(3): 323-344 (2008) |
| 2006 | ||
| j18 | | Lauri Hella, Jose Maria Turull Torres: Computing queries with higher-order logics. Theor. Comput. Sci. 355(2): 197-214 (2006) |
| c8 | | |
| 2003 | ||
| j17 | | |
| j16 | | Lauri Hella, Jose Maria Turull Torres: Expressibility of Higher Order Logics. Electr. Notes Theor. Comput. Sci. 84: 129-140 (2003) |
| j15 | | Kjell Lemström, Lauri Hella: Approximate pattern matching and transitive closure logics. Theor. Comput. Sci. 1-3(299): 387-412 (2003) |
| 2001 | ||
| j14 | | Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong: Logics with aggregate operators. J. ACM 48(4): 880-907 (2001) |
| 2000 | ||
| j13 | | Lauri Hella, Juha Nurmonen: Vectorization hierarchies of some graph quantifiers. Arch. Math. Log. 39(3): 183-207 (2000) |
| c7 | | Kjell Lemström, Lauri Hella: Approximate Pattern Matching is Expressible in Transitive Closure Logic. LICS 2000: 157-167 |
| 1999 | ||
| j12 | | Lauri Hella, Leonid Libkin, Juha Nurmonen: Notions of Locality and Their Logical Characterizations over Finite Models. J. Symb. Log. 64(4): 1751-1773 (1999) |
| c6 | | Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong: Logics with Aggregate Operators. LICS 1999: 35-44 |
| 1998 | ||
| j11 | | Lauri Hella, Henrik Imhof: Enhancing Fixed Point Logic with Cardinality Quantifiers. J. Log. Comput. 8(1): 71-86 (1998) |
| j10 |  | Anuj Dawar, Georg Gottlob, Lauri Hella: Capturing Relativized Complexity Classes without Order. Math. Log. Q. 44: 109-122 (1998) |
| c5 | | Anuj Dawar, Lauri Hella, Anil Seth: Ordering Finite Variable Types with Generalized Quantifiers. LICS 1998: 28-43 |
| 1997 | ||
| j9 | | Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models. Ann. Pure Appl. Logic 87(3): 241-267 (1997) |
| j8 | | Lauri Hella, Jouko A. Väänänen, Dag Westerståhl: Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6(3): 305-335 (1997) |
| 1996 | ||
| j7 | | Martin Grohe, Lauri Hella: A double arity hierarchy theorem for transitive closure logic. Arch. Math. Log. 35(3): 157-171 (1996) |
| j6 | | Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic 2(4): 422-443 (1996) |
| j5 | | |
| j4 | | Lauri Hella, Kerkko Luosto, Jouko A. Väänänen: The Hierarchy Theorem for Generalized Quantifiers. J. Symb. Log. 61(3): 802-817 (1996) |
| 1995 | ||
| j3 | | Anuj Dawar, Lauri Hella: The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. 123(2): 172-184 (1995) |
| c4 | | Anuj Dawar, Lauri Hella, Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635 |
| 1994 | ||
| c3 | | Anuj Dawar, Lauri Hella: The Expressive Power of Finitely Many Generalized Quantifiers. LICS 1994: 20-29 |
| c2 | | Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models. LICS 1994: 40-49 |
| 1992 | ||
| j2 | | Lauri Hella, Kerkko Luosto: The Beth-Closure of L(Qalpha) Is Not Finitely Generated. J. Symb. Log. 57(2): 442-448 (1992) |
| c1 | | |
| 1989 | ||
| j1 | | Lauri Hella: Definability Hierarchies of Generalized Quantifiers. Ann. Pure Appl. Logic 43(3): 235-271 (1989) |
Colors in the list of coauthors
Last update Fri May 24 05:36:14 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page