Higher-dimensional word problems with applications to equational logic
DOI10.1016/0304-3975(93)90054-WzbMATH Open0791.08004OpenAlexW2088405398MaRDI QIDQ685405FDOQ685405
Authors: Albert Burroni
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
Recommendations
Grammars and rewriting systems (68Q42) Equational logic, Mal'tsev conditions (08B05) Free semigroups, generators and relations, word problems (20M05) Word problems (aspects of algebraic structures) (08A50)
Cites Work
- Title not available (Why is that?)
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Title not available (Why is that?)
- The algebra of oriented simplexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (75)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coherence for modalities
- A class of recursive permutations which is primitive recursive complete
- The three dimensions of proofs
- A folk model structure on omega-cat
- Polygraphic resolutions and homology of monoids
- Coherent confluence modulo relations and double groupoids
- Algebraic coherent confluence and higher globular Kleene algebras
- Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories
- Minimality of the system of seven equations for the category of finite sets
- Categorified cyclic operads
- Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups
- A simplicial foundation for differential and sector forms in tangent categories
- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits
- Proof diagrams for multiplicative linear logic: syntax and semantics
- Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category
- Unifying notions of pasting diagrams
- Weak units, universal cells, and coherence via universality for bicategories
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Non-unital polygraphs form a presheaf category
- Tietze equivalences as weak equivalences
- Homotopy reduction systems for monoid presentations
- Monads, partial evaluations, and rewriting
- Coherence of Gray Categories via Rewriting
- Nerves and cones of free loop-free \(\omega\)-categories
- Convergent presentations and polygraphic resolutions of associative algebras
- Higher Dimensional Trees, Algebraically
- Higher-dimensional normalisation strategies for acyclicity
- Corelations are the prop for extraspecial commutative Frobenius monoids
- Homomorphisms of higher categories
- Algebra and geometry of rewriting
- Two polygraphic presentations of Petri nets
- Categorification, term rewriting and the Knuth-Bendix procedure
- Coherence in monoidal track categories
- Title not available (Why is that?)
- A Topological Perspective on Interacting Algebraic Theories
- Title not available (Why is that?)
- Noncommutative Gröbner Bases: Applications and Generalizations
- Coherent presentations of Artin monoids
- Towards an algebraic theory of Boolean circuits.
- A cubical Squier’s theorem
- A combinatorial-topological shape category for polygraphs
- Intensional properties of polygraphs
- A coherence theorem for pseudonatural transformations
- The structure of first-order causality
- Confluence of Graph Rewriting with Interfaces
- Title not available (Why is that?)
- Polygraphs of finite derivation type
- Abstract strategies and coherence
- A categorical characterization of strong Steiner \(\omega\)-categories
- Title not available (Why is that?)
- Termination orders for 3-polygraphs
- Termination orders for three-dimensional rewriting
- Lawvere Categories as Composed PROPs
- A rewriting coherence theorem with applications in homotopy type theory
- A graphical calculus for semi-groupal categories
- Polygraphs and Discrete Conduch{\'e} $\omega$-Functors
- Shuffle polygraphic resolutions for operads
- Regular planar monoidal languages
- Computads for weak \(\omega \)-categories as an inductive type
- Pregeometric spaces from Wolfram model rewriting systems as homotopy types
- Free precategories as presheaf categories
- Monoidal weak ω-categories as models of a type theory
- Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting
- Rewriting in Gray categories with applications to coherence
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclicity conditions on pasting diagrams
- Algebraic properties and transformations of monographs
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Termination of rewriting on reversible Boolean circuits as a free 3-category problem
- An inductive model structure for strict \(\infty\)-categories
- Polygraphic homology of local systems
This page was built for publication: Higher-dimensional word problems with applications to equational logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685405)