Abstract
Kleene algebras are structures with addition, multiplication and constants $0$ and $1$, which form an idempotent semiring, and the Kleene iteration operation. In the particular case of $*$-continuous Kleene algebras, Kleene iteration is defined, in an infinitary way, as the supremum of powers of an element. We obtain results on algorithmic complexity for Horn theories (semantic entailment from finite sets of hypotheses) of commutative $*$-continuous Kleene algebras. Namely, $\Pi_1^1$-completeness for the Horn theory and $\Pi^0_2$-completeness for its fragment, where iteration cannot be used in hypotheses, is proved. These results are commutative counterparts of the corresponding theorems of D. Kozen (2002) for the general (non-commutative) case. Several accompanying results are also obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
