Higher-dimensional word problems with applications to equational logic
From MaRDI portal
Publication:685405
Recommendations
Cites work
- scientific article; zbMATH DE number 431767 (Why is no real title available?)
- scientific article; zbMATH DE number 4177054 (Why is no real title available?)
- scientific article; zbMATH DE number 3125737 (Why is no real title available?)
- scientific article; zbMATH DE number 3944108 (Why is no real title available?)
- scientific article; zbMATH DE number 3783237 (Why is no real title available?)
- scientific article; zbMATH DE number 3505197 (Why is no real title available?)
- scientific article; zbMATH DE number 517043 (Why is no real title available?)
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- The algebra of oriented simplexes
Cited in
(76)- Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories
- Tietze equivalences as weak equivalences
- Categorification, term rewriting and the Knuth-Bendix procedure
- scientific article; zbMATH DE number 1279309 (Why is no real title available?)
- Noncommutative Gröbner bases: applications and generalizations
- Algebra and geometry of rewriting
- Nerves and cones of free loop-free \(\omega\)-categories
- A simplicial foundation for differential and sector forms in tangent categories
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- A folk model structure on omega-cat
- A class of recursive permutations which is primitive recursive complete
- Higher Dimensional Trees, Algebraically
- The three dimensions of proofs
- Polygraphic resolutions and homology of monoids
- Presenting finite posets
- Towards an algebraic theory of Boolean circuits.
- Coherent presentations of Artin monoids
- Convergent presentations and polygraphic resolutions of associative algebras
- Intensional properties of polygraphs
- scientific article; zbMATH DE number 1255555 (Why is no real title available?)
- Termination orders for 3-polygraphs
- Coherence in monoidal track categories
- Two polygraphic presentations of Petri nets
- Minimality of the system of seven equations for the category of finite sets
- Proof diagrams for multiplicative linear logic: syntax and semantics
- Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category
- A rewriting coherence theorem with applications in homotopy type theory
- Proof diagrams for multiplicative linear logic
- Termination orders for three-dimensional rewriting
- Lawvere categories as composed PROPs
- Confluence of graph rewriting with interfaces
- A graphical calculus for semi-groupal categories
- Homotopy reduction systems for monoid presentations
- Non-unital polygraphs form a presheaf category
- Categorified cyclic operads
- Coherent confluence modulo relations and double groupoids
- A cubical Squier's theorem
- Monads, partial evaluations, and rewriting
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- Coherence of Gray categories via rewriting
- Unifying notions of pasting diagrams
- A coherence theorem for pseudonatural transformations
- Corelations are the prop for extraspecial commutative Frobenius monoids
- A topological perspective on interacting algebraic theories
- Weak units, universal cells, and coherence via universality for bicategories
- Coherence for modalities
- The structure of first-order causality
- Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups
- Polygraphs and Discrete Conduch{\'e} $\omega$-Functors
- Homomorphisms of higher categories
- scientific article; zbMATH DE number 130895 (Why is no real title available?)
- Algebraic coherent confluence and higher globular Kleene algebras
- Polygraphs of finite derivation type
- Abstract strategies and coherence
- A categorical characterization of strong Steiner \(\omega\)-categories
- Higher-dimensional normalisation strategies for acyclicity
- scientific article; zbMATH DE number 517043 (Why is no real title available?)
- A combinatorial-topological shape category for polygraphs
- An inductive model structure for strict \(\infty\)-categories
- Monoidal weak ω-categories as models of a type theory
- Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting
- Algebraic properties and transformations of monographs
- Rewriting in Gray categories with applications to coherence
- Polygraphic homology of local systems
- The word problem for double categories
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Computads for weak \(\omega \)-categories as an inductive type
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
- Shuffle polygraphic resolutions for operads
- Free precategories as presheaf categories
- Pregeometric spaces from Wolfram model rewriting systems as homotopy types
- Orientals as free algebras
- Acyclicity conditions on pasting diagrams
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- Regular planar monoidal languages
- Termination of rewriting on reversible Boolean circuits as a free 3-category problem
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)
