Completeness for Identity-free Kleene Lattices

We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and
complete for the equational theory of their relational models. Our proof builds on the complete-
ness theorem for Kleene algebra, and on a novel automata construction that makes it possible to
extract axiomatic proofs using a Kleene-like algorithm.