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
Handbook of Logic and Language
Handbook of Logic and Language
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Action Logic and Pure Induction
JELIA '90 Proceedings of the European Workshop on Logics in AI
Double Residuated Lattices and Their Applications
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
An Infinitary Sequent System for the Equational Theory of *-continuous Action Lattices
Fundamenta Informaticae
| Hi-index | 0.00 |
Pratt [22] defines action algebras as Kleene algebras with residuals. In [9] it is shown that the equational theory of *-continuous action algebras (lattices) is Π$^{0}_{1}$–complete. Here we show that the equational theory of relational action algebras (lattices) is Π$^{0}_{1}$ –hard, and some its fragments are Π$^{0}_{1}$–complete. We also show that the equational theory of action algebras (lattices) of regular languages is Π$^{0}_{1}$–complete.