One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over omega-words. We show that it is expressively equivalent to the two-variable fragment of first-order logic. We also show that its satisfiability problem is NExpTime-complete. Further, we show undecidability of some extensions, whose two-variable counterparts remain decidable
In this paper, we examine the computational complexity of various natural one-variable fragments of ...
This paper considers the structure consisting of the set of all words over a given alphabet together...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
Uniform one-dimensional fragment UF is a formalism obtained from first-order logic by limiting quant...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We call a first-order formula one-dimensional if every maximal block of existential (or universal) q...
The uniform one-dimensional fragment U1 of first-order logic was introduced recently as a natural ge...
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted ove...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, ...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$...
We study fragments of first-order logic and of least fixed point logic that allow only unary negatio...
International audienceWe introduce a new decidable fragment of first-order logic with equality, whic...
International audienceWe study fragments of first-order logic and of least fixed point logic that al...
Expressiveness, and more recently, succinctness, are two central concerns of finite model theory and...
In this paper, we examine the computational complexity of various natural one-variable fragments of ...
This paper considers the structure consisting of the set of all words over a given alphabet together...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
Uniform one-dimensional fragment UF is a formalism obtained from first-order logic by limiting quant...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We call a first-order formula one-dimensional if every maximal block of existential (or universal) q...
The uniform one-dimensional fragment U1 of first-order logic was introduced recently as a natural ge...
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted ove...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, ...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$...
We study fragments of first-order logic and of least fixed point logic that allow only unary negatio...
International audienceWe introduce a new decidable fragment of first-order logic with equality, whic...
International audienceWe study fragments of first-order logic and of least fixed point logic that al...
Expressiveness, and more recently, succinctness, are two central concerns of finite model theory and...
In this paper, we examine the computational complexity of various natural one-variable fragments of ...
This paper considers the structure consisting of the set of all words over a given alphabet together...
First-order logic has a long tradition and is one of the most prominent and most important formalism...