11 citations · 13 across the 5 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2022★ 2 cited
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…
cs.LO2021
Games for Succinctness of Regular Expressions
Miikka Vilander
We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size. We use the re…
cs.LO2019★ 11 cited
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…