Lecture Notes in Computer Science 7560, 2012We give a new, significantly shorter proof of the completeness of the left-handed star rule of Kleene algebra. The proof exposes the rich interaction of algebra and coalgebra in the theory of Kleene algebra
Kleene algebras are an important class of algebraic structures that arise in diverse areas of comput...
In the literature on Kleene algebra, a number of variants have been proposed which impose additional...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
We prove two completeness results for Kleene algebra with a top element, with respect to languages a...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and comple...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed ...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
A classical result from Redko [14] says that there does not exist a complete finite equational axiom...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen’s (19...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
We study the Horn theories of Kleene algebras and star continuous Kleene algebras, from the complexi...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
Kleene algebras are an important class of algebraic structures that arise in diverse areas of comput...
In the literature on Kleene algebra, a number of variants have been proposed which impose additional...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
We prove two completeness results for Kleene algebra with a top element, with respect to languages a...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and comple...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed ...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
A classical result from Redko [14] says that there does not exist a complete finite equational axiom...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen’s (19...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
We study the Horn theories of Kleene algebras and star continuous Kleene algebras, from the complexi...
We prove cut-elimination for a sequent-style proof system which is sound and complete for the equati...
Kleene algebras are an important class of algebraic structures that arise in diverse areas of comput...
In the literature on Kleene algebra, a number of variants have been proposed which impose additional...
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regu...
DOI
Add to ORKG