...
首页> 外文期刊>LIPIcs : Leibniz International Proceedings in Informatics >Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)
【24h】

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)

机译:(Kleene + Action)(代数+格)的非充分证明理论

获取原文

摘要

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.
机译:我们证明了后继式证明系统的割除,该证明系统对Kleene代数的方程式理论来说是健全且完整的,并且证明(可能)是没有充分根据的无限树。我们将这些结果扩展到具有相遇和残差的系统,以类似的方式捕获“恒星连续”动作晶格。通过限制为正则证明(带割),我们恢复了所有作用格的方程式理论,这些证明是有限图的展开。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号