Data structures for quasistrict higher categories
From MaRDI portal
Abstract: We present new data structures for quasistrict higher categories, in which associativity and unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional algebraic definitions of higher categories, and we use it to give a practical definition of quasistrict 4-category. It is also amenable to computer implementation, and we exploit this to give a new machine-verified algebraic proof that every adjunction of 1-cells in a quasistrict 4-category can be promoted to a coherent adjunction satisfying the butterfly equations.
Recommendations
Cited in
(11)- Coherence of Gray categories via rewriting
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
- Weak units, universal cells, and coherence via universality for bicategories
- Rewriting in Gray categories with applications to coherence
- A skew approach to enrichment for Gray-categories
- Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting
- Free precategories as presheaf categories
- Zigzag normalisation for associative n-categories
- High-level methods for homotopy construction in associative \(n\)-categories
- Posetal diagrams for logically-structured semistrict higher categories
- Rewriting modulo in diagrammatic algebras and application to categorification
This page was built for publication: Data structures for quasistrict higher categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144694)