11 citations · 16 across the 4 of their papers we have counts for
6 papers
Defining long words succinctly in FO and MSO
Lauri Hella, Miikka Vilander
We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of heig…
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants
Lauri Hella, Antti Kuusisto, Raine Rönnholm
We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus. Our so-called bounded GTS replaces parity games with alternative evaluation games where only finite pat…
Formula size games for modal logic and -calculus
Lauri Hella, Miikka Vilander
We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators an…
Complexity Thresholds in Inclusion Logic
Miika Hannula, Lauri Hella
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-determinist…
The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
Lauri Hella, Miikka Vilander
We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators an…
The size of a formula as a measure of complexity
Lauri Hella, Jouko Väänänen
We introduce a refinement of the usual Ehrenfeucht-Fra\"ıssé game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to meas…