Higher-dimensional word problems with applications to equational logic
From MaRDI portal
Publication:685405
DOI10.1016/0304-3975(93)90054-WzbMath0791.08004OpenAlexW2088405398MaRDI QIDQ685405
Publication date: 20 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90054-w
Free semigroups, generators and relations, word problems (20M05) Equational logic, Mal'tsev conditions (08B05) Grammars and rewriting systems (68Q42) Word problems (aspects of algebraic structures) (08A50)
Related Items (63)
Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Monads, partial evaluations, and rewriting ⋮ A simplicial foundation for differential and sector forms in tangent categories ⋮ Coherent confluence modulo relations and double groupoids ⋮ Tietze equivalences as weak equivalences ⋮ A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Weak units, universal cells, and coherence via universality for bicategories ⋮ Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category ⋮ A combinatorial-topological shape category for polygraphs ⋮ A Topological Perspective on Interacting Algebraic Theories ⋮ Minimality of the system of seven equations for the category of finite sets ⋮ A graphical calculus for semi-groupal categories ⋮ Shuffle polygraphic resolutions for operads ⋮ Categorification, term rewriting and the Knuth-Bendix procedure ⋮ Monoidal weak ω-categories as models of a type theory ⋮ Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting ⋮ Nerves and cones of free loop-free \(\omega\)-categories ⋮ A categorical characterization of strong Steiner \(\omega\)-categories ⋮ Towards an algebraic theory of Boolean circuits. ⋮ Abstract strategies and coherence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Higher-dimensional normalisation strategies for acyclicity ⋮ Unnamed Item ⋮ Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Unnamed Item ⋮ Coherence of Gray Categories via Rewriting ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ Algebra and geometry of rewriting ⋮ A coherence theorem for pseudonatural transformations ⋮ Unnamed Item ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Coherence in monoidal track categories ⋮ Coherence for modalities ⋮ Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits ⋮ Unifying notions of pasting diagrams ⋮ Lawvere Categories as Composed PROPs ⋮ A folk model structure on omega-cat ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ The three dimensions of proofs ⋮ Homomorphisms of higher categories ⋮ Two polygraphic presentations of Petri nets ⋮ Termination orders for three-dimensional rewriting ⋮ Non-unital polygraphs form a presheaf category ⋮ Polygraphic resolutions and homology of monoids ⋮ The structure of first-order causality ⋮ A cubical Squier’s theorem ⋮ Categorified cyclic operads ⋮ Polygraphs and Discrete Conduch{\'e} $\omega$-Functors ⋮ Unnamed Item ⋮ Homotopy reduction systems for monoid presentations ⋮ Proof diagrams for multiplicative linear logic: syntax and semantics ⋮ Corelations are the prop for extraspecial commutative Frobenius monoids ⋮ Polygraphs of finite derivation type ⋮ Coherent presentations of Artin monoids ⋮ Intensional Properties of Polygraphs ⋮ Rewriting in Gray categories with applications to coherence ⋮ Termination orders for 3-polygraphs ⋮ A rewriting coherence theorem with applications in homotopy type theory
Cites Work
This page was built for publication: Higher-dimensional word problems with applications to equational logic
