首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:Proof Orders for Decreasing Diagrams
  • 本地全文:下载
  • 作者:Bertram Felgenhauer ; Vincent van Oostrom
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2013
  • 卷号:21
  • 页码:174-189
  • DOI:10.4230/LIPIcs.RTA.2013.174
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We present and compare some well-founded proof orders for decreasing diagrams. These proof orders order a conversion above another conversion if the latter is obtained by filling any peak in the former by a (locally) decreasing diagram. Therefore each such proof order entails the decreasing diagrams technique for proving confluence. The proof orders differ with respect to monotonicity and complexity. Our results are developed in the setting of involutive monoids. We extend these results to obtain a decreasing diagrams technique for confluence modulo.
  • 关键词:involutive monoid; confluence modulo; decreasing diagram; proof order
国家哲学社会科学文献中心版权所有