1 citations · 2 across the 4 of their papers we have counts for
4 papers
On the complexity of Maslov's class
Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
Maslov's class is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been es…
A Uniform One-Dimensional Fragment with Alternation of Quantifiers
Emanuel Kieroński
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving…
Extending Two-Variable Logic on Trees
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieroński
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions o…
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
Emanuel Kieroński, Antti Kuusisto
Uniform one-dimensional fragment UF1^= is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers su…