[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |
Originator: Bruno Courcelle
Date: January 2005
Summary: Equational axiomatization of graph operations
Given a set of graph operations like disjoint union, edge-complement, quantifier-free definable operations (like relabellings). When can one axiomatize its equational theory by finitely many equational rules or by infinitely many rules describable in finitary ways?
See [BC87].
[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |