A complete axiomatisation of reversible Kleene lattices

Research paper by Paul Brunet

Indexed on: 21 Feb '19Published on: 21 Feb '19Published in: arXiv - Computer Science - Logic in Computer Science


We consider algebras of languages over the signature of reversible Kleene lattices, that is the regular operations (empty and unit languages, union, concatenation and Kleene star) together with intersection and mirror image. We provide a complete set of axioms for the equational theory of these algebras. This proof was developed in the proof assistant Coq.