Termination orders for 3-polygraphs

Simple item page
dc.creatorGuiraud, Yves
dc.date2006-12-04
dc.date.accessioned2026-07-07T07:38:34Z
dc.date.available2026-07-07T07:38:34Z
dc.descriptionThis note presents the first known class of termination orders for 3-polygraphs, together with an application.
dc.description4 pages, 12 figures
dc.identifierhttps://arxiv.org/abs/math/0612084
dc.identifierhttp://arxiv.org/abs/math/0612084
dc.identifierComptes-Rendus de l'Academie des Sciences Serie I, Volume 342, Issue 4, 15 February 2006, Pages 219-222
dc.identifierdoi:10.1016/j.crma.2005.12.019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121130
dc.subjectCategory Theory
dc.subjectLogic in Computer Science
dc.subject08A50; 08A70; 16S15; 18C10; 18D05; 68Q70
dc.titleTermination orders for 3-polygraphs
dc.typetext

Files

Collections

arXiv