View source for N-monoid

{{DISPLAYTITLE:''n''-monoid}}
In [[Category theory|category theory]], a '''(strict) ''n''-monoid''' is an [[N-category|''n''-category]] with only one 0-cell. In particular, a 1-monoid is a [[Monoid|monoid]] and a 2-monoid is a strict monoidal category.

==References==
*{{cite book
 | author = Albert Burroni
 | year = 1993
 | title = Higher dimensional word problems with applications to equational logic
 | publisher = Theoretical Computer Science
 | url = http://www.pps.univ-paris-diderot.fr/~burroni/mapage/highwordpb.pdf
}}
==Further reading==
* {{nlab|id=n-monoid|title=n-monoid}}

{{Category theory}}

[[Category:Higher category theory]]

{{Sourceattribution|N-monoid}}