Two-variable logic with a between relation

From MaRDI portal
Publication:4635866

DOI10.1145/2933575.2935308zbMATH Open1394.03011arXiv1603.05625OpenAlexW2531234554WikidataQ130849109 ScholiaQ130849109MaRDI QIDQ4635866FDOQ4635866


Authors: A. Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing Edit this on Wikidata


Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: We study an extension of FO^2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, `the letter a appears between positions x and y'. This is, in a sense, the simplest property that is not expressible using only two variables. We present several logics, both first-order and temporal, that have the same expressive power, and find matching lower and upper bounds for the complexity of satisfiability for each of these formulations. We also give an effective necessary condition, in terms of the syntactic monoid of a regular language, for a property to be expressible in this logic. We show that this condition is also sufficient for words over a two-letter alphabet. This algebraic analysis allows us us to prove, among other things, that our new logic has strictly less expressive power than full first-order logic FO[<].


Full work available at URL: https://arxiv.org/abs/1603.05625




Recommendations




Cited In (6)





This page was built for publication: Two-variable logic with a between relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635866)