Free Kleene algebras with domain - Université Nice Sophia Antipolis Accéder directement au contenu
Article Dans Une Revue Journal of Logical and Algebraic Methods in Programming Année : 2019

Free Kleene algebras with domain

Résumé

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous case when the signature includes all the Kleene algebra with domain operations; that is, we add union and reflexive transitive closure to the signature. In this second case, elements of the free algebras are 'regular' sets of the trees of the first case. As a corollary, the axioms of domain semirings provide a finite quasiequational axiomatisation of the equational theory of algebras of binary relations for the intermediate signature of composition, union, and domain. Next we note that our regular sets of trees are not closed under complement, but prove that they are closed under intersection. Finally, we prove that under relational semantics the equational validities of Kleene algebras with domain form a decidable set.
Fichier principal
Vignette du fichier
kleene_jlamp__arxiv_v2.pdf (248.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03018506 , version 1 (22-11-2020)

Identifiants

  • HAL Id : hal-03018506 , version 1

Citer

Brett Mclean. Free Kleene algebras with domain. Journal of Logical and Algebraic Methods in Programming, 2019. ⟨hal-03018506⟩
37 Consultations
12 Téléchargements

Partager

Gmail Facebook X LinkedIn More