Logic and information flow
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Equational properties of Kleene algebras of relations with conversion
Theoretical Computer Science
The variety of Kleene algebras with conversion is not finitely based
Theoretical Computer Science
Action Logic and Pure Induction
JELIA '90 Proceedings of the European Workshop on Logics in AI
The equational theory of Kleene lattices
Theoretical Computer Science
Hi-index | 0.00 |
We show that there is no finitely axiomatizable class of algebras that would serve as an analogue to Kozen's class of Kleene algebras if we include the residuals of composition in the similarity type of relation algebras.