This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Das et al. (2018) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: