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.

翻译：我们利用最近采用的一个代数框架对一阶逻辑的碎片进行分类,我们研究了第一阶逻辑的几个定序碎片的相对性问题的复杂性,这些问题是从定序逻辑和流传逻辑中得出的,通过修改这些逻辑的一些同源法限制而获得的。