An Algebraic Characterisation of First-Order Logic with Neighbour

05/19/2021
by   Amaldev Manuel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2020

Extensions of ω-Regular Languages

We consider extensions of monadic second order logic over ω-words, which...
research
07/03/2021

First-Order logic and its Infinitary Quantifier Extensions over Countable Words

We contribute to the refined understanding of the language-logic-algebra...
research
03/09/2023

π-augmented pregroups and applications to linguistics

We enrich pregroups with a mapping which allows us to locally apply prec...
research
06/23/2021

Substitution Principle and semidirect products

In the classical theory of regular languages the concept of recognition ...
research
02/19/2021

Les claviers, un modèle de calcul

We introduce a new formalisation of languages, called keyboards. We cons...
research
01/27/2022

Positive First-order Logic on Words and Graphs

We study FO+, a fragment of first-order logic on finite words, where mon...
research
05/10/2023

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication

Higher-dimensional automata (HDA) are a formalism to model the behaviour...

Please sign up or login with your details

Forgot password? Click here to reset