Skip to Main content Skip to Navigation
Conference papers

A cut-free cyclic proof system for Kleene algebra

Anupam Das 1, 2 Damien Pous 1, 2
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We introduce a sound non-wellfounded proof system whose regular (or 'cyclic') proofs are complete for (in)equations between regular expressions. We achieve regularity by using hypersequents rather than usual sequents, with more structure in the succedent, and relying on the discreteness of rational languages to drive proof search. By inspection of the proof search space we extract a PSpace bound for the system, which is optimal for deciding such (in)equations.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Damien Pous Connect in order to contact the contributor
Submitted on : Friday, July 7, 2017 - 10:36:19 AM
Last modification on : Saturday, September 11, 2021 - 3:18:35 AM
Long-term archiving on: : Wednesday, January 24, 2018 - 8:21:29 AM


Files produced by the author(s)


  • HAL Id : hal-01558132, version 1



Anupam Das, Damien Pous. A cut-free cyclic proof system for Kleene algebra. TABLEAUX, Sep 2017, Brasilia, Brazil. ⟨hal-01558132⟩



Record views


Files downloads