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
International audienceKleene algebra axioms are complete with respect to both language models and bi...
International audienceKleene algebra axioms are complete with respect to both language models and bi...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
We investigate the equational theory of reversible Kleene lattices, that is algebras of languages wi...
International audienceWe investigate the equational theory of reversible Kleene lattices, that is al...
We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and comple...
International audienceThe equational theory generated by all algebras of binary relations with opera...
International audienceThe equational theory generated by all algebras of binary relations with opera...
AbstractWe describe a set of equational axioms for the variety generated by all algebras of binary r...
We prove two completeness results for Kleene algebra with a top element, with respect to languages a...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
International audienceKleene algebra axioms are complete with respect to both language models and bi...
International audienceKleene algebra axioms are complete with respect to both language models and bi...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
We investigate the equational theory of reversible Kleene lattices, that is algebras of languages wi...
International audienceWe investigate the equational theory of reversible Kleene lattices, that is al...
We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and comple...
International audienceThe equational theory generated by all algebras of binary relations with opera...
International audienceThe equational theory generated by all algebras of binary relations with opera...
AbstractWe describe a set of equational axioms for the variety generated by all algebras of binary r...
We prove two completeness results for Kleene algebra with a top element, with respect to languages a...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
International audienceWe provide a finite set of axioms for identity-free Kleene lattices, which we ...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
International audienceKleene algebra axioms are complete with respect to both language models and bi...
International audienceKleene algebra axioms are complete with respect to both language models and bi...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...