Termination orders for 3-dimensional rewriting
| dc.creator | Guiraud, Yves | |
| dc.date | 2006-12-04 | |
| dc.date.accessioned | 2026-07-07T07:38:34Z | |
| dc.date.available | 2026-07-07T07:38:34Z | |
| dc.description | This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each system are studied. Finally, a convergent 3-polygraph for the (commutative) theory of Z/2Z-vector spaces is given. In order to prove these results, it is explained how to craft a class of termination orders for 3-polygraphs. | |
| dc.description | 30 pages, 35 figures | |
| dc.identifier | https://arxiv.org/abs/math/0612083 | |
| dc.identifier | http://arxiv.org/abs/math/0612083 | |
| dc.identifier | Journal of Pure and Applied Algebra, Volume 207, Issue 2, October 2006, Pages 341-371 | |
| dc.identifier | doi:10.1016/j.jpaa.2005.10.011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/121129 | |
| dc.subject | Category Theory | |
| dc.subject | Logic in Computer Science | |
| dc.subject | 08A50; 08A70; 16S15; 18C10; 18D05; 68Q70 | |
| dc.title | Termination orders for 3-dimensional rewriting | |
| dc.type | text |