License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2015.84
URN: urn:nbn:de:0030-drops-56428
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5642/
Go to the corresponding LIPIcs Volume Portal


Karandikar, Prateek ; Schnoebelen, Philippe

Decidability in the Logic of Subsequences and Supersequences

pdf-format:
26.pdf (0.5 MB)


Abstract

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of variables, we show that the FO^2 theory is decidable while the FO^3 theory is undecidable.

BibTeX - Entry

@InProceedings{karandikar_et_al:LIPIcs:2015:5642,
  author =	{Prateek Karandikar and Philippe Schnoebelen},
  title =	{{Decidability in the Logic of Subsequences and Supersequences}},
  booktitle =	{35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
  pages =	{84--97},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-97-2},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{45},
  editor =	{Prahladh Harsha and G. Ramalingam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5642},
  URN =		{urn:nbn:de:0030-drops-56428},
  doi =		{10.4230/LIPIcs.FSTTCS.2015.84},
  annote =	{Keywords: subsequence, subword, logic, first-order logic, decidability, piecewise- testability, Simonís congruence}
}

Keywords: subsequence, subword, logic, first-order logic, decidability, piecewise- testability, Simonís congruence
Seminar: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Issue Date: 2015
Date of publication: 11.12.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI