{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:23Z","timestamp":1780743683050,"version":"3.54.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study first-order logic (FO) over the structure consisting of finite words\nover some alphabet $A$, together with the (non-contiguous) subword ordering. In\nterms of decidability of quantifier alternation fragments, this logic is\nwell-understood: If every word is available as a constant, then even the\n$\\Sigma_1$ (i.e., existential) fragment is undecidable, already for binary\nalphabets $A$. However, up to now, little is known about the expressiveness of\nthe quantifier alternation fragments: For example, the undecidability proof for\nthe existential fragment relies on Diophantine equations and only shows that\nrecursively enumerable languages over a singleton alphabet (and some auxiliary\npredicates) are definable. We show that if $|A|\\ge 3$, then a relation is\ndefinable in the existential fragment over $A$ with constants if and only if it\nis recursively enumerable. This implies characterizations for all fragments\n$\\Sigma_i$: If $|A|\\ge 3$, then a relation is definable in $\\Sigma_i$ if and\nonly if it belongs to the $i$-th level of the arithmetical hierarchy. In\naddition, our result yields an analogous complete description of the\n$\\Sigma_i$-fragments for $i\\ge 2$ of the pure logic, where the words of $A^*$\nare not available as constants.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:35)2023","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T08:55:15Z","timestamp":1703148915000},"source":"Crossref","is-referenced-by-count":2,"title":["Existential Definability over the Subword Ordering"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Pascal","family":"Baumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moses","family":"Ganardi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramanathan S.","family":"Thinniyam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2023,12,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12730\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12730\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T08:55:15Z","timestamp":1703148915000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:35)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2210.15642v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.15642v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2210.15642","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2210.15642","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,21]]},"article-number":"10219"}}