Lauri Hella

Research output

Research output per year 1989 1992 1994 1995 1996 1997 1998 1999 2000 2003 2006 2008 2013 2014 2015 2016 2017 2019 2022 2023 2024 2025

• 35 Article
• 27 Conference contribution
• 3 Chapter

Research output per year

Research output per year

Search results

• 2025

  Descriptive complexity for distributed computing with circuits

  Ahvonen, V., Heiman, D., Hella, L. & Kuusisto, A., Jan 2025, (E-pub ahead of print) In: JOURNAL OF LOGIC AND COMPUTATION. exae087.

  Research output: Contribution to journal › Article › Scientific › peer-review

  Open Access

  File

  • Distributed Computing 100%
  • Computation Time 100%
  • Message Passing 100%
  • time-delay 50%
  • Expressive Power 50%
  6 Downloads (Pure)
• 2024

  Defining long words succinctly in FO and MSO

  Hella, L. & Vilander, M., 28 Nov 2024, In: Computability. 13, 3-4, p. 377-398 22 p.

  Research output: Contribution to journal › Article › Scientific › peer-review

  Open Access

  File

  • Upper Bound 100%
  • Lower and upper bounds 100%
  • Definability 100%
  • Cumulative Hierarchy 100%
  • Rational Power 100%
  3 Downloads (Pure)

• 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

  Open Access

  File

  • Team Semantics 100%
  • Family of Sets 100%
  • Minimal Set 100%
  • Upper Dimension 75%
  • Growth Class 75%
  42 Downloads (Pure)

• 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

  Open Access

  File

  • Optimal Strategy 100%
  • First-order 33%
  • Two-player Games 33%
  • One-player Game 33%
  • Separating Structure 33%
  1 Citation (Scopus)

  20 Downloads (Pure)
• 2023

  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

  Open Access

  File

  • Truth Value 100%
  • Predicate Logic 100%
  • Completeness Proofs 100%
  • Ternary Logic 100%
  • Completeness Proof 100%
  16 Downloads (Pure)
• 2022

  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

  Open Access

  File

  • Game-theoretic Semantics 100%
  • Modal μ-calculus 100%
  • Model Checking 100%
  • μ-calculus 100%
  • Μ-calculus 50%
  43 Downloads (Pure)

• 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

  Open Access

  File

  • Polynomial Time 100%
  • Logarithmic Space 100%
  • Inclusion Logic 100%
  • Syntactics 50%
  • Complexity Class 50%
  3 Citations (Scopus)

  19 Downloads (Pure)
• 2021

  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

  Open Access

  File

  • Prefix 100%
  • IF Logic 100%
  • Independence-friendly Logic 100%
  • Henkin 100%
  • Restrict Attention 100%
  1 Citation (Scopus)

  16 Downloads (Pure)
• 2019

  Formula size games for modal logic and mu-calculus

  Hella, L. T. & Vilander, M. S., 2019, In: JOURNAL OF LOGIC AND COMPUTATION. 29, 8, p. 1311-1344 exz025.

  Research output: Contribution to journal › Article › Scientific › peer-review

  File

  • Formula Size Game 100%
  • Μ-calculus 100%
  • μ-calculus 100%
  • Modal Logic 100%
  • Bisimulation Invariant 100%
  14 Citations (Scopus)

  36 Downloads (Pure)

• Model checking and validity in propositional and modal inclusion logics

  Hella, L., Kuusisto, A., Meier, A. & Virtema, J., 2019, In: JOURNAL OF LOGIC AND COMPUTATION. 29, 5, p. 605-630 26 p.

  Research output: Contribution to journal › Article › Scientific › peer-review

  • Modal 100%
  • Inclusion Logic 100%
  • Model Checking 100%
  • Team Semantics 66%
  • Logic-based 33%
  9 Citations (Scopus)

• Satisfiability of modal inclusion logic: Lax and strict semantics

  Hella, L., Kuusisto, A., Meier, A. & Vollmer, H., 2019, In: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. 21, 1, 7.

  Research output: Contribution to journal › Article › Scientific › peer-review

  • Modal 100%
  • Inclusion Logic 100%
  • Computational Complexity 100%
  • Satisfiability Problem 100%
  • Class-specific 50%
  4 Citations (Scopus)
• 2017

  Boolean dependence logic and partially-ordered connectives

  Ebbing, J., Hella, L., Lohmann, P. & Virtema, J., 2017, In: Journal of Computer and System Sciences. 88, p. 103-125

  Research output: Contribution to journal › Article › Scientific › peer-review
  2 Citations (Scopus)
• 2016

  Existential second-order logic and modal logic with quantified accessibility relations

  Hella, L. & Kuusisto, A., 2016, In: Information and Computation. 247, p. 217-234

  Research output: Contribution to journal › Article › Scientific › peer-review
• 2015

  Weak models of distributed computing, with connections to modal logic

  Hella, L., Järvisalo, M., Kuusisto, A., Laurinharju, J., Lempiäinen, T., Luosto, K., Suomela, J. & Jonni, V., 2015, In: Distributed Computing. 28, 1, p. 31-53

  Research output: Contribution to journal › Article › Scientific › peer-review
  39 Citations (Scopus)
• 2013

  On the existence of a modal-logical basis for monadic second-order logic

  Hella, L. & Tulenheimo, T., 2013, In: JOURNAL OF LOGIC AND COMPUTATION. 23, 1, p. 157-180

  Research output: Contribution to journal › Article › Scientific › peer-review
• 2008

  Partially ordered connectives and monadic monotone strict NP

  Hella, L., Sevenster, M. & Tulenheimo, T., 2008, In: JOURNAL OF LOGIC, LANGUAGE AND INFORMATION. 17, 3, p. 323-344

  Research output: Contribution to journal › Article › Scientific › peer-review
  2 Citations (Scopus)

• Term definable classes of Boolean functions and frame definability in modal logic

  Couceiro, M., Hella, L. & Kivelä, J., 2008, In: Logic Journal of the Interest Group in Pure and Applied Logics. 16, 1, p. 43-73

  Research output: Contribution to journal › Article › Scientific › peer-review
• 2006

  Computing queries with higher order logics

  Hella, L. & Turull-Torres, J., 2006, In: Theoretical Computer Science. 355, p. 197-214

  Research output: Contribution to journal › Article › Scientific › peer-review

  11 Citations (Scopus)
• 2003

  Approximate pattern matching and transitive closure logic

  Lemström, K. & Hella, L., 2003, In: Theoretical Computer Science. 299, p. 387-412

  Research output: Contribution to journal › Article › Scientific › peer-review

  2 Citations (Scopus)

• Expressibility of higher order logics

  Hella, L. & Turull-Torres, J. M., 2003, In: Electronic Notes in Theoretical Computer Science. 84

  Research output: Contribution to journal › Article › Scientific › peer-review

  7 Citations (Scopus)
• 2001

  Logics with aggregate operators

  Hella, L., Libkin, L., Nurmonen, J. & Wong, L., 2001, In: JOURNAL OF THE ACM. 48, 4, p. 880-907

  Research output: Contribution to journal › Article › Scientific › peer-review
  55 Citations (Scopus)
• 2000

  Vectorization hierarchies of some graph quantifiers

  Hella, L. & Nurmonen, J., 2000, In: Archive for Mathematical Logic. 39, 3, p. 183-207

  Research output: Contribution to journal › Article › Scientific › peer-review

  1 Citation (Scopus)
• 1999

  Notions of locality and their logical characterizations over finite models

  Hella, L., Libkin, L. & Nurmonen, J., 1999, In: JOURNAL OF SYMBOLIC LOGIC. 64, 4, p. 1751-1773

  Research output: Contribution to journal › Article › Scientific › peer-review
  35 Citations (Scopus)
• 1998

  Capturing relativized complexity classes without order

  Dawar, A., Gottlob, G. & Hella, L., 1998, In: Mathematical Logic Quarterly. 44, p. 109-122

  Research output: Contribution to journal › Article › Scientific › peer-review

  6 Citations (Scopus)

• Enhancing fixed point logic with cardinality quantifiers

  Hella, L. & Imhof, H., 1998, In: JOURNAL OF LOGIC AND COMPUTATION. 8, p. 71-86

  Research output: Contribution to journal › Article › Scientific › peer-review

  3 Citations (Scopus)
• 1997

  Definability of polyadic lifts of generalized quantifiers

  Hella, L., Väänänen, J. & Westerståhl, D., 1997, In: JOURNAL OF LOGIC, LANGUAGE AND INFORMATION. 6, p. 305-335

  Research output: Contribution to journal › Article › Scientific › peer-review

  20 Citations (Scopus)

• How to define a linear order on finite models

  Hella, L., Kolaitis, P. & Luosto, K., 1997, In: ANNALS OF PURE AND APPLIED LOGIC. 87, p. 241-267

  Research output: Contribution to journal › Article › Scientific › peer-review

  9 Citations (Scopus)
• 1996

  A double arity hierarchy theorem for transitive closure logic

  Martin, G. & Hella, L., 1996, In: Archive for Mathematical Logic. 35, p. 157-171

  Research output: Contribution to journal › Article › Scientific › peer-review

  5 Citations (Scopus)

• Almost everywhere equivalence of logics in finite model theory

  Hella, L., Kolaitis, P. & Luosto, K., 1996, In: BULLETIN OF SYMBOLIC LOGIC. 2, p. 422-443

  Research output: Contribution to journal › Article › Scientific › peer-review

  41 Citations (Scopus)

• Logical hierarchies in PTIME

  Hella, L., 1996, In: Information and Computation. 129, p. 1-19

  Research output: Contribution to journal › Article › Scientific › peer-review

  103 Citations (Scopus)

• The hierarchy theorem for generalized quantifiers

  Hella, L., Luosto, K. & Väänänen, J., 1996, In: JOURNAL OF SYMBOLIC LOGIC. 61, p. 802-817

  Research output: Contribution to journal › Article › Scientific › peer-review

  18 Citations (Scopus)
• 1995

  The expressive power of finitely many generalized quantifiers

  Dawar, A. & Hella, L., 1995, In: Information and Computation. 123, p. 172-184

  Research output: Contribution to journal › Article › Scientific › peer-review

  18 Citations (Scopus)
• 1992

  The Beth-closure of L(Q_alpha) is not finitely generated

  Hella, L. & Luosto, K., 1992, In: JOURNAL OF SYMBOLIC LOGIC. 57, p. 442-448

  Research output: Contribution to journal › Article › Scientific › peer-review
• 1991

  Remarks on the Cartesian closure

  Hella, L. & Krynicki, M., 1991, In: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 37, p. 539-545

  Research output: Contribution to journal › Article › Scientific › peer-review

  1 Citation (Scopus)
• 1989

  Definability hierarchies of generalized quantifiers

  Hella, L., 1989, In: ANNALS OF PURE AND APPLIED LOGIC. 43, p. 235-271

  Research output: Contribution to journal › Article › Scientific › peer-review

  46 Citations (Scopus)