A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Proof Orders for Decreasing Diagrams
2013
International Conference on Rewriting Techniques and Applications
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
doi:10.4230/lipics.rta.2013.174
dblp:conf/rta/FelgenhauerO13
fatcat:y5dqm24cvzcfxfkzg7swi5ipde