@inproceedings{b1ea30c499e247a5acc7527d2b0437f7,

title = "Left-handed completeness for Kleene algebra, via cyclic proofs",

abstract = "We give a new proof that the axioms of left-handed Kleene algebra are complete with respect to language containments. This proof is significantly simpler than both the proof of Boffa (which relies on Krob{\textquoteright}s completeness result), and the more recent proof of Kozen and Silva. Our proof builds on a recent non-wellfounded sequent calculus which makes it possible to explicitly compute the invariants required for left-handed Kleene algebra",

keywords = "automata, axiomatisation, cyclic proofs, induction, Kleene algebra, regular languages",

author = "Anupam Das and Amina Doumane and Damien Pous",

year = "2018",

month = oct,

day = "23",

doi = "10.29007/hzq3",

language = "English",

series = "EPiC Series in Computing",

publisher = "EasyChair Publications",

pages = "271--289",

editor = "Gilles Barthe and Geoff Sutcliffe and Margus Veanes",

booktitle = "LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning",

note = "22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning ; Conference date: 16-11-2018 Through 21-11-2018",

}