Using a recently introduced algebraic framework for classifying fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the ordered logic and the fluted logic by modifying some of their syntactical restrictions.publishedVersionPeer reviewe
The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragm...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...
The fluted fragment is a fragment of first-order logic in which the order of quantification of varia...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
The satisfiability problem for the two-variable fragment of first-order logic is investigated over f...
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of va...
We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of ...
We study the complexity of some fragments of first-order temporal logic over natural numbers time. T...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
abstract: It is well-known that first-order logic is semi-decidable. Therefore, first-order logic is...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
Descriptive complexity aims to classify properties of finite structures according to the logical res...
The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragm...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...
The fluted fragment is a fragment of first-order logic in which the order of quantification of varia...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
The satisfiability problem for the two-variable fragment of first-order logic is investigated over f...
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of va...
We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of ...
We study the complexity of some fragments of first-order temporal logic over natural numbers time. T...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
abstract: It is well-known that first-order logic is semi-decidable. Therefore, first-order logic is...
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
Descriptive complexity aims to classify properties of finite structures according to the logical res...
The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragm...
Aiming to pinpoint the reasons behind the decidability of some complex extensions of modal logic, we...
The fluted fragment is a fragment of first-order logic in which the order of quantification of varia...
DOI
Add to ORKG