Ordered Fragments of First-Order Logic
Reijo Jaakkola · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2021
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.