A proof order for decreasing diagrams Interpreting conversions in involutive monoids
by
Vincent Van Oostrom A
BibTeX
@MISC{A_aproof,
author = {Vincent Van Oostrom A},
title = {A proof order for decreasing diagrams Interpreting conversions in involutive monoids},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce the decreasing proof order. It orders a conversion above another conversion if the latter is obtained by filling any peak in the former by a decreasing diagram. The result is developed in the setting of involutive monoids.
Citations
| 822 | Term rewriting and All That - Baader, Nipkow - 1998 |
| 64 | Term Rewriting Systems - TeReSe - 2003 |
| 26 | Equational inference, canonical proofs, and proof orderings - Bachmair, Dershowitz - 1994 |
| 7 | Church-Rosser theorems for abstract reduction modulo an equivalence relation - Ohlebusch - 1998 |
| 3 | Involutive categories and monoids, with a GNScorrespondence - Jacobs - 2011 |
| 3 | Diagrammatic confluence and completion - Jouannaud, Oostrom - 2009 |
| 2 | A reduction-preserving completion for proving confluence of nonterminating term rewriting systems - Aoto, Toyama - 2011 |
| 1 | An abstract factorization theorem for explicit substitutions calculi - Accattoli - 2012 |
| 1 | Iterative lexicographic path orders. In: Algebra, Meaning and Computation: Essays dedicated to Joseph A - Klop, Oostrom, et al. - 2006 |
| 1 | Confluence by decreasing diagrams, converted - Oostrom - 2008 |
