Left-Handed completeness

Authors:
Dexter Kozen;Alexandra Silva
Affiliations:
Computer Science Department, Cornell University, Ithaca, NY;Radboud University, Nijmegen, The Netherlands
Venue:
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Year:
2012

Citing 7
Cited 0

Complete systems of B -rational identities

Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Group axioms for iteration

Information and Computation
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Substructural logic and partial correctness

ACM Transactions on Computational Logic (TOCL)
A coinductive calculus of streams

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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.