English

An Algebraic Characterisation of First-Order Logic with Neighbour

Logic in Computer Science 2021-05-21 v1 Formal Languages and Automata Theory

Abstract

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution semigroups. To characterise the logic, we define a special kind of semidirect product of involution semigroups, called the locally hermitian product. The characterisation theorem for FO with neighbour states that a language is definable in the logic if and only if it is recognised by a locally hermitian product of an aperiodic commutative involution semigroup, and a locally trivial involution semigroup. We then define the notion of involution varieties of languages, namely classes of languages closed under Boolean operations, quotients, involution, and inverse images of involutory morphisms. An Eilenberg-type correspondence is established between involution varieties of languages and pseudovarieties of involution semigroups.

Keywords

Cite

@article{arxiv.2105.09368,
  title  = {An Algebraic Characterisation of First-Order Logic with Neighbour},
  author = {Amaldev Manuel and Dhruv Nevatia},
  journal= {arXiv preprint arXiv:2105.09368},
  year   = {2021}
}

Comments

13 pages