Ordered fragments of first-order logic

03/14/2021
by   Reijo Jaakkola, et al.
0

Using a recently introduced algebraic framework for the classification of 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2022

On the Existential Fragments of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carr...
research
06/23/2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version)

We consider the family of guarded and unguarded ordered logics, that con...
research
07/10/2023

First order synthesis for data words revisited

We carry on the study of the synthesis problem on data words for fragmen...
research
09/09/2017

Simulating Linear Logic in 1-Only Linear Logic

Linear Logic was introduced by Girard as a resource-sensitive refinement...
research
01/08/2019

Languages ordered by the subword order

We consider a language together with the subword relation, the cover rel...
research
07/08/2020

On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic

Second-order Boolean logic is a generalization of QBF, whose constant al...
research
02/26/2019

SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --

We present the derivation reduction problem for SLD-resolution, the unde...

Please sign up or login with your details

Forgot password? Click here to reset