Termination orders for 3-polygraphs

Yves Guiraud

doi:10.1016/j.crma.2005.12.019

Logic/Computer Science

Termination orders for 3-polygraphs

Presented by: Jean-Yves Girard

Yves Guiraud ¹

¹Institut de mathématiques de Luminy, 13288 Marseille cedex 9, France

Comptes Rendus. Mathématique, Volume 342 (2006) no. 4, pp. 219-222

Abstract (Original language)
Résumé

This Note presents the first known class of termination orders for 3-polygraphs, together with an application.

Cette Note présente la première classe connue d'ordres de terminaison adaptés aux 3-polygraphes, ainsi qu'une application.

Received: 2005-05-04
Accepted: 2005-12-06
Published online: 2006-01-18

DOI: 10.1016/j.crma.2005.12.019

Author's affiliations:

Yves Guiraud ¹

¹ Institut de mathématiques de Luminy, 13288 Marseille cedex 9, France

@article{CRMATH_2006__342_4_219_0,
     author = {Yves Guiraud},
     title = {Termination orders for 3-polygraphs},
     journal = {Comptes Rendus. Math\'ematique},
     pages = {219--222},
     year = {2006},
     publisher = {Elsevier},
     volume = {342},
     number = {4},
     doi = {10.1016/j.crma.2005.12.019},
     language = {en},
}

TY  - JOUR
AU  - Yves Guiraud
TI  - Termination orders for 3-polygraphs
JO  - Comptes Rendus. Mathématique
PY  - 2006
SP  - 219
EP  - 222
VL  - 342
IS  - 4
PB  - Elsevier
DO  - 10.1016/j.crma.2005.12.019
LA  - en
ID  - CRMATH_2006__342_4_219_0
ER  -

%0 Journal Article
%A Yves Guiraud
%T Termination orders for 3-polygraphs
%J Comptes Rendus. Mathématique
%D 2006
%P 219-222
%V 342
%N 4
%I Elsevier
%R 10.1016/j.crma.2005.12.019
%G en
%F CRMATH_2006__342_4_219_0

Yves Guiraud. Termination orders for 3-polygraphs. Comptes Rendus. Mathématique, Volume 342 (2006) no. 4, pp. 219-222. doi: 10.1016/j.crma.2005.12.019

References
Cited by

[1] A. Burroni Higher-dimensional word problems with applications to equational logic, Theoret. Comput. Sci., Volume 115 (1993)

[2] Y. Guiraud, Termination orders for 3-dimensional rewriting, J. Pure Appl. Algebra (2004), in press

[3] Y. Lafont Towards an algebraic theory of boolean circuits, J. Pure Appl. Algebra, Volume 184 (2003)

Cited by Sources:

Comments - Policy