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
- Albert Burroni (1993). Higher dimensional word problems with applications to equational logic (PDF). Theoretical Computer Science.
Further reading
|  | |||||||||||||||||
| ||||||||||||||||||
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.