Termination orders for 3-polygraphs

DOI10.1016/J.CRMA.2005.12.019zbMATH Open1086.68101arXivmath/0612084OpenAlexW2044155717MaRDI QIDQ817890FDOQ817890

Authors: Yves Guiraud 

Publication date: 20 March 2006

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/math/0612084

Recommendations

• Termination orders for three-dimensional rewriting
• Polygraph arrangements
• scientific article; zbMATH DE number 1924513
• Polygraphs of finite derivation type
• Termination tools in ordered completion
• Intensional properties of polygraphs
• scientific article; zbMATH DE number 3930339
• The matching polynomial of a polygraph
• Termination orderings for rippling
• Uncurrying for Termination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cites Work

• Termination orders for three-dimensional rewriting
• Higher-dimensional word problems with applications to equational logic
• Towards an algebraic theory of Boolean circuits.

This page was built for publication: Termination orders for 3-polygraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817890)