Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.38
URN: urn:nbn:de:0030-drops-65782
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6578/
Kieronski, Emanuel
One-Dimensional Logic over Words
| pdf-format: |
|
Abstract
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over omega-words. We show that it is expressively equivalent to the two-variable fragment of first-order logic. We also show that its satisfiability problem is NExpTime-complete. Further, we show undecidability of some extensions, whose two-variable counterparts remain decidable.
BibTeX - Entry
@InProceedings{kieronski:LIPIcs:2016:6578,
author = {Emanuel Kieronski},
title = {{One-Dimensional Logic over Words}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6578},
URN = {urn:nbn:de:0030-drops-65782},
doi = {10.4230/LIPIcs.CSL.2016.38},
annote = {Keywords: satisfiability, expressivity, words, fragments of first-order logic}
}
| Keywords: | satisfiability, expressivity, words, fragments of first-order logic | |
| Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 29.08.2016 |
