Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Hella, Lauri"'
The circuit complexity class DLOGTIME-uniform AC^0 is known to be a modest subclass of DLOGTIME-uniform TC^0. The weakness of AC^0 is caused by the fact that AC^0 is not closed under restricting AC^0-computable queries into simple subsequences of the
Externí odkaz:
http://arxiv.org/abs/2309.06926
Autor:
Dawar, Anuj, Hella, Lauri
We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B satisfies cer
Externí odkaz:
http://arxiv.org/abs/2308.03695
We introduce three measures of complexity for families of sets. Each of the three measures, that we call dimensions, is defined in terms of the minimal number of convex subfamilies that are needed for covering the given family: for upper dimension, t
Externí odkaz:
http://arxiv.org/abs/2304.03354
We consider distributed algorithms in the realistic scenario where distributed message passing is operated via circuits. We show that within this setting, modal substitution calculus MSC captures the expressive power of circuits. The translations bet
Externí odkaz:
http://arxiv.org/abs/2303.04735
Autor:
Hella, Lauri, Vilander, Miikka
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 height linear in n. We prove this by counting types with respect to a fixe
Externí odkaz:
http://arxiv.org/abs/2202.10180
Autor:
Valmari, Antti, Hella, Lauri
Publikováno v:
Notre Dame J. Formal Logic 64(1): 61--93 (February 2023)
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined"
Externí odkaz:
http://arxiv.org/abs/2112.04436
Publikováno v:
EPTCS 326, 2020, pp. 82-96
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 paths arise; infinite paths are not needed even when the considered trans
Externí odkaz:
http://arxiv.org/abs/2009.10880
Autor:
Hella, Lauri, Vilander, Miikka
Publikováno v:
Journal of Logic and Computation, exz025, Oxford University Press, 2019
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 and binary connectives. Our game is similar to the well-known Adler-Imme
Externí odkaz:
http://arxiv.org/abs/1912.08715
Autor:
Hannula, Miika, Hella, Lauri
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in these logics
Externí odkaz:
http://arxiv.org/abs/1903.10706
Publikováno v:
In Information and Computation November 2022 289 Part B