Non-wellfounded proof theory for (Kleene+action)(algebras+lattices) - Archive ouverte HAL Access content directly
Conference Papers Year :

Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

Anupam Das
  • Function : Author
  • PersonId : 962493


We prove cut-elimination for a sequent-style proof system which is sound and complete for the equational theory of Kleene algebra, and where proofs are potentially non-wellfounded infinite trees. We extend these results to systems with meets and residuals, capturing 'star-continuous' action lattices in a similar way. We recover the equational theory of all action lattices by restricting to regular proofs (with cut)—those proofs that are unfoldings of finite graphs.
Fichier principal
Vignette du fichier
lka.pdf (472.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01703942 , version 1 (08-02-2018)
hal-01703942 , version 2 (27-04-2018)
hal-01703942 , version 3 (29-06-2018)



Anupam Das, Damien Pous. Non-wellfounded proof theory for (Kleene+action)(algebras+lattices). Computer Science Logic (CSL), Sep 2018, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.CSL.2018.19⟩. ⟨hal-01703942v3⟩
309 View
254 Download



Gmail Facebook Twitter LinkedIn More