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