Strict \(n\)-hypercategories (Q1860909): Difference between revisions

The approach to higher-dimensional categories proposed here grows out of that of \textit{J. C. Baez} and \textit{J. Dolan} [Adv. Math. 135, 145-206 (1998; Zbl 0909.18006)] and attempts to avoid using so-called advanced category theory. Using trees, the authors define a combinatorial notion of shell which allows them to discuss pasting diagrams and hypergraphs. Strict \(n\)-hypercategories are defined here, generalizing strict \(n\)-categories; however, the weak case was discussed by the second and third authors, using these ideas, at the CT99 conference in Coimbra Portugal (July 1999).