Misplaced Pages

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

• n-monoid at the nLab

v t e Category theory
Key concepts Key concepts Category Abelian Additive Concrete Pre-abelian Preadditive Bicategory Adjoint functors CCC Commutative diagram End Exponential Functor Kan extension Morphism Natural transformation Universal property Yoneda lemma Universal constructions Limits Terminal objects Products Equalizers Kernels Pullbacks Inverse limit Colimits Initial objects Coproducts Coequalizers Cokernels and quotients Pushout Direct limit Algebraic categories Sets Relations Magmas Groups Abelian groups Rings (Fields) Modules (Vector spaces) Constructions on categories Free category Functor category Kleisli category Opposite category Quotient category Product category Comma category Subcategory
Higher category theory Key concepts Categorification Enriched category Higher-dimensional algebra Homotopy hypothesis Model category Simplex category String diagram Topos n-categories Weak n-categories Bicategory (pseudofunctor) Tricategory Tetracategory Kan complex ∞-groupoid ∞-topos Strict n-categories 2-category (2-functor) 3-category Categorified concepts 2-group 2-ring En-ring (Traced)(Symmetric) monoidal category n-group n-monoid
Category Outline Glossary

This category theory-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Category theory stubs
• Higher category theory