  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.
