A cut-free cyclic proof system for Kleene algebra - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Conference Papers Year : 2017

A cut-free cyclic proof system for Kleene algebra

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.
Fichier principal
Vignette du fichier
hka.pdf (390.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01558132 , version 1 (07-07-2017)

Identifiers

  • HAL Id : hal-01558132 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More