On Kleene algebras and closed semirings
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Action Logic and Pure Induction
JELIA '90 Proceedings of the European Workshop on Logics in AI
On Finite Model Property of the Equational Theory of Kleene Algebras
Fundamenta Informaticae
On the complexity of the equational theory of relational action algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Hi-index | 0.00 |
We present an infinitary logic ACT_ω in the form of aGentzen-style sequent system, which is equivalent to the equationaltheory of *-continuous action lattices [9]. We prove thecut-elimination theorem for ACT_ω and, as a consequence, atheorem on the elimination of negative occurrences of *. This showsthat ACT_ω is Π^0_1, whence, by a result of Buszkowski[1], it is Π^0_1 complete.