@inproceedings{84cc9e314471464fab55cb78ee39fe76,
title = "Ordered Fragments of First-Order Logic",
abstract = "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. ",
keywords = "Complexity, Decidability, Fluted logic, Ordered logic",
author = "Reijo Jaakkola",
note = "Funding Information: Funding The research leading to this work was supported by the Academy of Finland grants 324435 and 328987. Publisher Copyright: {\textcopyright} Reijo Jaakkola; licensed under Creative Commons License CC-BY 4.0 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). jufoid=79091; International Symposium on Mathematical Foundations of Computer Science ; Conference date: 23-07-2021 Through 27-07-2021",
year = "2021",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.MFCS.2021.62",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Filippo Bonchi and Puglisi, {Simon J.}",
booktitle = "46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021",
}