n-monoid
In category theory, a (strict) n-monoid is an n-category with only one 0-cell. In particular, a 1-monoid is a monoid and a 2-monoid is a strict monoidal category.
References
[edit]- Albert Burroni (1993). Higher dimensional word problems with applications to equational logic (PDF). Theoretical Computer Science.
Further reading
[edit]
|  | |||||||||||||||||
| ||||||||||||||||||
 | This category theory-related article is a stub. You can help Wikipedia by expanding it. |