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.
BibTeX - Entry
@InProceedings{jaakkola:LIPIcs.MFCS.2021.62,
author = {Jaakkola, Reijo},
title = {{Ordered Fragments of First-Order Logic}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14502},
URN = {urn:nbn:de:0030-drops-145025},
doi = {10.4230/LIPIcs.MFCS.2021.62},
annote = {Keywords: ordered logic, fluted logic, complexity, decidability}
}
|
Keywords: |
|
ordered logic, fluted logic, complexity, decidability |
|
Collection: |
|
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
18.08.2021 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)