scientific article
From MaRDI portal
Publication:3138543
zbMath0789.18004MaRDI QIDQ3138543
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
symbolic computationword problemsPenrose diagramscomplete rewrite systemcategory of finite sets2-dimensional rewritingfinitely presentable 2-monoid
Related Items (7)
Optimal reductions in interaction systems ⋮ Minimality of the system of seven equations for the category of finite sets ⋮ Towards an algebraic theory of Boolean circuits. ⋮ Higher-dimensional word problems with applications to equational logic ⋮ Termination orders for three-dimensional rewriting ⋮ GS·Λ Theories ⋮ Classes of finite relations as initial abstract data types. II
This page was built for publication: